|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10473 occurrences of 4385 keywords
|
|
|
Results
Found 17726 publication records. Showing 17726 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
29 | Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri |
The Area Determined by Underdiagonal Lattice Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: Trees in Algebra and Programming - CAAP'96, 21st International Colloquium, Linköping, Sweden, April, 22-24, 1996, Proceedings, pp. 59-71, 1996, Springer, 3-540-61064-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
underdiagonal lattice paths, average area, first passage decomposition, generating functions, context-free grammars |
29 | Joseph S. B. Mitchell, Christos H. Papadimitriou |
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(1), pp. 18-73, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
terrain navigation, weighted distance functions, shortest paths, Voronoi diagrams, Dijkstra's algorithm |
29 | Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu 0002, Chung-Kuan Cheng, Michael D. Hutton |
Efficient static timing analysis using a unified framework for false paths and multi-cycle paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, Yokohama, Japan, January 24-27, 2006, pp. 73-78, 2006, IEEE, 0-7803-9451-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
biclique covering, false subgraphs, multi-cycle subgraphs, static timing analysis, time shifting |
29 | Liam Roditty, Uri Zwick |
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 249-260, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Manish Sharma, Janak H. Patel |
What Does Robust Testing a Subset of Paths, Tell us about the Untested Paths in the Circuit? ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 22nd IEEE VLSI Test Symposium (VTS 2004), 25-29 April 2004, Napa Valley, CA, USA, pp. 31-36, 2004, IEEE Computer Society, 0-7695-2134-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | John Hershberger 0001, Subhash Suri, Amit M. Bhosle |
On the difficulty of some shortest path problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(1), pp. 5:1-5:15, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
k shortest simple paths, replacement path, lower bound, shortest path |
28 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 165-178, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization |
28 | Gábor Rétvári, József Bíró, Tibor Cinkler |
On Improving the Accuracy of OSPF Traffic Engineering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: NETWORKING 2006 - Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 5th International IFIP-TC6 Networking Conference, Coimbra, Portugal, May 15-19, 2006, Proceedings, pp. 51-62, 2006, Springer, 3-540-34192-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
linear programming, shortest paths, traffic engineering, OSPF |
28 | Unmil Karadkar, Luis Francisco-Revilla, Richard Furuta, Frank M. Shipman III, Avital Arora, Suvendu Dash, Pratik Dave, Emily Luke |
Metadocuments supporting digital library information discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Digit. Libr. ![In: Int. J. Digit. Libr. 4(1), pp. 25-30, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Waldens Paths, Metadocuments, Digital library services, Hypertext, Path maintenance |
28 | David Wessels, Jon C. Muzio |
The dangers of simplistic delay models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 8(1), pp. 61-69, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
critical paths, Delay models, path sensitization, circuit delays |
28 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 1183-1192, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Yuan Tian 0019, Ken C. K. Lee, Wang-Chien Lee |
Monitoring minimum cost paths on road networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, November 4-6, 2009, Seattle, Washington, USA, Proceedings, pp. 217-226, 2009, ACM, 978-1-60558-649-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
path search and updates, location-based services, road networks, monitoring system |
28 | Sourabh Bhattacharya, Rafael Murrieta-Cid, Seth Hutchinson 0001 |
Optimal Paths for Landmark-Based Navigation by Differential-Drive Vehicles With Field-of-View Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Robotics ![In: IEEE Trans. Robotics 23(1), pp. 47-59, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Torsten Tholey |
Solving the 2-Disjoint Paths Problem in Nearly Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 39(1), pp. 51-78, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Sangman Moh, Sang Jun Lee, Chansu Yu |
Tree-Based Multicast Meshes with Variable Density of Redundant Paths on Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WASA ![In: Wireless Algorithms, Systems, and Applications, First International Conference, WASA 2006, Xi'an, China, August 15-17, 2006, Proceedings, pp. 515-526, 2006, Springer, 3-540-37189-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Yigal Bejerano, Yuri Breitbart, Ariel Orda, Rajeev Rastogi, Alexander Sprintson |
Algorithms for computing QoS paths with restoration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 13(3), pp. 648-661, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
restricted shortest path, approximation algorithms, QoS routing, restoration |
28 | Wankang Zhao, William C. Kreahling, David B. Whalley, Christopher A. Healy, Frank Mueller 0001 |
Improving WCET by Optimizing Worst-Case Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Real-Time and Embedded Technology and Applications Symposium ![In: 11th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2005), 7-10 March 2005, San Francisco, CA, USA, pp. 138-147, 2005, IEEE Computer Society, 0-7695-2302-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Yinzhen Li, Ruichun He, Linzhong Liu, Yaohuang Guo |
Genetic Algorithms for Dissimilar Shortest Paths Based on Optimal Fuzzy Dissimilar Measure and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I, pp. 312-320, 2005, Springer, 3-540-28312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Gábor Rétvári, Róbert Szabó, József Bíró |
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NETWORKING ![In: NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004, Proceedings, pp. 1180-1191, 2004, Springer, 3-540-21959-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
routing, linear programming, Traffic engineering, OSPF |
28 | Hiroshi Mamitsuka, Yasushi Okuno |
A Hierarchical Mixture of Markov Models for Finding Biologically Active Metabolic Paths Using Gene Expression and Protein Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, CSB 2004, Stanford, CA, USA, August 16-19, 2004, pp. 341-352, 2004, IEEE Computer Society, 0-7695-2194-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations on Optical Baseline Networks with Node-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 10th International Conference on Parallel and Distributed Systems, ICPADS 2004, Newport Beach, CA, USA, July 7-9, 2004, pp. 65-72, 2004, IEEE Computer Society, 0-7695-2152-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Torsten Tholey |
Solving the 2-Disjoint Paths Problem in Nearly Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 350-361, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Gilles Pokam, François Bodin |
An Offline Approach for Whole-Program Paths Analysis Using Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCPC ![In: Languages and Compilers for High Performance Computing, 17th International Workshop, LCPC 2004, West Lafayette, IN, USA, September 22-24, 2004, Revised Selected Papers, pp. 363-378, 2004, Springer, 3-540-28009-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Ann Nowé, Katja Verbeeck, Peter Vrancx |
Multi-type Ant Colony: The Edge Disjoint Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS Workshop ![In: Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5 - 8, 2004, Proceedings, pp. 202-213, 2004, Springer, 3-540-22672-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Ian J. Hayes |
Programs as Paths: An Approach to Timing Constraint Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 5th International Conference on Formal Engineering Methods, ICFEM 2003, Singapore, November 5-7, 2003, Proceedings, pp. 1-15, 2003, Springer, 3-540-20461-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Sergei Bespamyatnikh |
Computing homotopic shortest paths in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 609-617, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
28 | Scott Seongwook Lee, Mario Gerla |
Fault Tolerance and Load Balancing in QoS Provisioning with Multiple MPLS Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWQoS ![In: Quality of Service - IWQoS 2001, 9th International Workshop Karlsruhe, Germany, June 6-8, 2001, Proceedings, pp. 155-169, 2001, Springer, 3-540-42217-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Thomas Erlebach, Klaus Jansen |
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 195-206, 2000, Springer, 3-540-42512-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Luisa Gargano, Pavol Hell, Stephane Perennes |
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 505-515, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Timothy M. Burks, Karem A. Sakallah, Trevor N. Mudge |
Critical paths in circuits with level-sensitive latches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 3(2), pp. 273-291, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Kranthi K. Mamidisetty, Minlan Duan, Shivakumar Sastry, P. S. Sastry |
Multipath Dissemination in Regular Mesh Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 20(8), pp. 1188-1201, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Gerold Schneider, Kaarel Kaljurand, Fabio Rinaldi 0001 |
Detecting Protein-Protein Interactions in Biomedical Texts Using a Parser and Linguistic Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CICLing ![In: Computational Linguistics and Intelligent Text Processing, 10th International Conference, CICLing 2009, Mexico City, Mexico, March 1-7, 2009. Proceedings, pp. 406-417, 2009, Springer, 978-3-642-00381-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Xing Jin, Wanqing Tu, S.-H. Gary Chan |
Traceroute-Based Topology Inference without Network Coordinate Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 1615-1619, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Gábor Rétvári, József Bíró, Tibor Cinkler |
On shortest path representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(6), pp. 1293-1306, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
linear programming, traffic engineering, shortest path routing |
26 | Jianxi Fan, Xiaola Lin, Xiaohua Jia |
Optimal Path Embedding in Crossed Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(12), pp. 1190-1200, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
optimal embedding, interconnection network, graph embedding, Crossed cube, parallel computing system |
26 | Xiang Lu, Zhuo Li 0001, Wangqi Qiu, D. M. H. Walker, Weiping Shi |
Longest-path selection for delay test under process variation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(12), pp. 1924-1929, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Matthew Andrews, Antonio Fernández 0001, Ashish Goel, Lisa Zhang |
Source routing and scheduling in packet networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(4), pp. 582-601, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Adversarial queuing theory, packet scheduling, packet routing, end-to-end delay, network stability |
26 | Kapil Vaswani, Matthew J. Thazhuthaveetil, Y. N. Srikant |
A Programmable Hardware Path Profiler. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGO ![In: 3nd IEEE / ACM International Symposium on Code Generation and Optimization (CGO 2005), 20-23 March 2005, San Jose, CA, USA, pp. 217-228, 2005, IEEE Computer Society, 0-7695-2298-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | David W. Griffith, SuKyoung Lee |
Dynamic Expansion of M : N Protection Groups in GMPLS Optical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 31st International Conference on Parallel Processing Workshops (ICPP 2002 Workshops), 20-23 August 2002, Vancouver, BC, Canada, pp. 171-176, 2002, IEEE Computer Society, 0-7695-1680-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Shmuel Zaks |
Duality in ATM Layout Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, pp. 44-58, 2000, Springer, 3-540-67159-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
26 | Mary Lou Soffa |
Tutorial: Techniques to Improve the Scalability and Precision of Data Flow Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 6th International Symposium, SAS '99, Venice, Italy, September 22-24, 1999, Proceedings, pp. 355-356, 1999, Springer, 3-540-66459-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Glenn Ammons, James R. Larus |
Improving Data-flow Analysis with Path Profiles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, June 17-19, 1998, pp. 72-84, 1998, ACM, 0-89791-987-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Glenn Ammons, James R. Larus |
Improving data-flow analysis with path profiles (with retrospective) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Best of PLDI ![In: 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, A Selection, pp. 568-582, 1998, ACM, 1-58113-623-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Rajiv Gupta 0001, David A. Berson, Jesse Zhixi Fang |
Path Profile Guided Partial Redundancy Elimination Using Speculation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCL ![In: Proceedings of the 1998 International Conference on Computer Languages, ICCL 1998, Chicago, IL, USA, May 14-16, 1998, pp. 230-239, 1998, IEEE Computer Society, 0-8186-8454-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Sitaran Yadavalli, Irith Pomeranz, Sudhakar M. Reddy |
MUSTC-Testing: Multi-Stage-Combinational Test scheduling at the Register-Transfer Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 8th International Conference on VLSI Design (VLSI Design 1995), 4-7 January 1995, New Delhi, India, pp. 110-115, 1995, IEEE Computer Society, 0-8186-6905-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
MUSTC-testing, multi-stage-combinational test, control paths, signal types, module level pre-computed test sets, scheduling, logic testing, integrated circuit testing, combinational circuits, automatic testing, automatic test, register-transfer level, test scheduling, data-paths |
26 | Shigang Chen, Meongchul Song, Sartaj Sahni |
Two techniques for fast computation of constrained shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 16(1), pp. 105-115, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, QoS routing, constrained shortest paths |
26 | Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni |
Dynamic Multi-level Overlay Graphs for Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 709-736, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Shortest paths algorithms, speed-up techniques |
26 | Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad |
Paths and Trails in Edge-Colored Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 723-735, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
properly edge-colored paths, trails and cycles, connectivity, Edge colored graphs |
26 | Frederic Kleinermann, Olga De Troyer, Christophe Creelle, Bram Pellens |
Adding Semantic Annotations, Navigation Paths and Tour Guides to Existing Virtual Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VSMM ![In: Virtual Systems and Multimedia, 13th International Conference, VSMM 2007, Brisbane, Australia, September 23-26, 2007, Revised Selected Papers, pp. 100-111, 2007, Springer, 978-3-540-78565-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Virtual Reality, Semantic Annotations, Tour guides, Navigation Paths |
26 | Matthew Andrews, Lisa Zhang |
Logarithmic hardness of the undirected edge-disjoint paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(5), pp. 745-761, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hardness of approximation, undirected graphs, edge-disjoint paths |
26 | Mathias Géry |
Indexing "Reading Paths" for a Structured Information Retrieval at INEX 2006. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INEX ![In: Comparative Evaluation of XML Information Retrieval Systems, 5th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2006, Dagstuhl Castle, Germany, December 17-20, 2006, Revised and Selected Papers, pp. 160-164, 2006, Springer, 978-3-540-73887-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Reading Paths, Indexation, Web Information Retrieval, Information Propagation, Web structure |
26 | Hsien-Jone Hsieh, Dyi-Rong Duh |
Constructing Node-Disjoint Paths in Enhanced Pyramid Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia-Pacific Computer Systems Architecture Conference ![In: Advances in Computer Systems Architecture, 11th Asia-Pacific Conference, ACSAC 2006, Shanghai, China, September 6-8, 2006, Proceedings, pp. 380-386, 2006, Springer, 3-540-40056-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Enhanced pyramid networks, pyramid networks, fault-tolerance, interconnection networks, container, node-disjoint paths, wide diameter |
26 | Elena Barcucci, Antonio Bernini, Luca Ferrari 0001, Maddalena Poneti |
A Distributive Lattice Structure Connecting Dyck Paths, Noncrossing Partitions and 312-avoiding Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 22(4), pp. 311-328, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Dyck paths, noncrossing partitions, 312-avoiding permutations, Bell and Catalan numbers, strong Bruhat order, distributive lattice |
26 | Haruko Okamura |
Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(4), pp. 503-514, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
k-edge-connected, disjoint 2 paths, 2-reducible |
26 | Luciano Gualà, Guido Proietti |
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30 - September 2, 2005, Proceedings, pp. 941-951, 2005, Springer, 3-540-28700-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Equilibria in Distributed Systems, Single-Source Shortest Paths Tree, Algorithmic Mechanism Design, Selfish Agents, Truthful Mechanisms |
26 | Matthew Andrews, Lisa Zhang |
Hardness of the undirected edge-disjoint paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 276-283, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hardness of approximation, undirected graphs, edge-disjoint paths |
26 | Camil Demetrescu, Giuseppe F. Italiano |
A new approach to dynamic all pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(6), pp. 968-992, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
shortest paths, Dynamic graph algorithms |
26 | Martin Preiß, Josef Stoer |
Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 99(3), pp. 499-520, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
infeasible interior-point-paths, semidefinite programming, linear complementarity problems |
26 | P. David Stotts, Richard Furuta |
Language-theoretic classification of hypermedia paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hypertext ![In: HYPERTEXT 2004, Proceedings of the 15th ACM Conference on Hypertext and Hypermedia, August 9-13, 2004, Santa Cruz, California, USA, pp. 40-41, 2004, ACM, 1-58113-848-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
models, theory, automata, paths |
26 | Víctor M. Jiménez, Andrés Marzal, Vicente Palazón, Guillermo Peris |
Computing the Cyclic Edit Distance for Pattern Classification by Ranking Edit Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops, SSPR 2004 and SPR 2004, Lisbon, Portugal, August 18-20, 2004 Proceedings, pp. 125-133, 2004, Springer, 3-540-22570-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Cyclic strings, cyclic edit distance, Bunke and Bühler algorithm, OCR, string matching, K shortest paths, handwritten text recognition |
26 | Camil Demetrescu, Giuseppe F. Italiano |
A new approach to dynamic all pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 159-166, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
shortest paths, dynamic graph algorithms |
26 | Roch Guérin, Ariel Orda |
Computing shortest paths for any number of hops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 10(5), pp. 613-620, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
hop-restricted shortest paths, maximum bandwidth, minimum delay, networks, quality-of-service routing |
26 | Uri Zwick |
All pairs shortest paths using bridging sets and rectangular matrix multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(3), pp. 289-317, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
shortest paths, Matrix multiplication |
26 | Xiaowei Li 0001, Toshimitsu Masuzawa, Hideo Fujiwara |
Strong self-testability for data paths high-level synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, pp. 229-234, 2000, IEEE Computer Society, 0-7695-0887-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
self-testability, testability constraints, interconnection assignment, test resources reusability, high level synthesis, high-level synthesis, design for testability, register transfer level, data flow graphs, data paths, register assignment |
26 | Toshimitsu Masuzawa, Minoru Izutsu, Hiroki Wada, Hideo Fujiwara |
Single-control testability of RTL data paths for BIST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, pp. 210-215, 2000, IEEE Computer Society, 0-7695-0887-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
single-control testability, RTL data paths, BIST method, response analyzers, DFT method, high fault coverage, low hardware overhead, VLSI, logic testing, built-in self test, integrated circuit testing, design for testability, automatic test pattern generation, ATPG, test pattern generators, delay faults, VLSI circuits, at-speed testing, transition faults, digital integrated circuits, single stuck-at faults, hierarchical test |
26 | Giuseppe Di Battista, Roberto Tamassia, Luca Vismara |
Output-Sensitive Reporting of Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(4), pp. 302-340, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Triconnected graph, Biconnected graph, Connectivity, Coloring, Graph drawing, Disjoint paths |
26 | Mikkel Thorup |
Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(3), pp. 362-394, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
RAM algorithms, shortest paths |
26 | Uri Zwick |
All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 310-319, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Bridging sets, Randomized algorithms, Shortest paths, Matrix multiplication |
26 | Chotipat Pornavalai, Goutam Chakraborty, Norio Shiratori |
QoS routing algorithms for pre-computed paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1997), September 22-25, 1997 Las Vegas, NV, USA, pp. 248-255, 1997, IEEE Computer Society, 0-8186-8186-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
pre-computed paths, QoS routing algorithms, multiple QoS constraints, QoSR/sub BF/ on-demand algorithm, flow specification parameters, routing table size reduction, bandwidth, NP-complete problem, telecommunication network routing |
26 | Qian-Ping Gu, Hisao Tamaki |
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 561-567, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
algorithm, Permutation routing, edge-disjoint paths, circuit-switched networks |
26 | Apostolos A. Kountouris |
Safe and efficient elimination of infeasible execution paths in WCET estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: Third International Workshop on Real-Time Computing Systems Application (RTCSA '96), October 30 - November 01, 1996, Seoul, Korea, pp. 187-194, 1996, IEEE Computer Society, 0-8186-7626-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
infeasible execution paths, WCET estimation, time critical systems, R/T programming language, Dynamic Graph representation, real-time systems, SIGNAL, timing properties, Worst Case Execution Time |
26 | B. Hamdi, Hakim Bederr, Michael Nicolaidis |
A tool for automatic generation of self-checking data paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 13th IEEE VLSI Test Symposium (VTS'95), April 30 - May 3, 1995, Princeton, New Jersey, USA, pp. 460-466, 1995, IEEE Computer Society, 0-8186-7000-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
self-checking data paths, ALUs, shifters, double rail checkers, logic testing, built-in self test, microprocessors, adders, circuit CAD, multipliers, microcontrollers, register files, circuit design, CAD tools, automatic generation, automatic test software, dividers, circuit testing, parity checkers |
26 | Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis |
Modularity of Cycles and Paths in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(2), pp. 255-274, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
cycles and paths, graphs, modularity |
25 | Yangjun Chen, Donovan Cooke |
XPath query evaluation based on the stack encoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C3S2E ![In: Canadian Conference on Computer Science & Software Engineering, C3S2E 2009, Montreal, Quebec, Canada, May 19-21, 2009, Proceedings, pp. 43-57, 2009, ACM, 978-1-60558-401-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
XML pattern matching, twig joins, trees, XML databases, paths |
25 | Wei Le, Mary Lou Soffa |
Refining buffer overflow detection via demand-driven path-sensitive analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PASTE ![In: Proceedings of the 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE'07, San Diego, California, USA, June 13-14, 2007, pp. 63-68, 2007, ACM, 978-1-59593-595-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
path-sensitive, demand-driven, infeasible paths |
25 | Srecko Brlek, Gilbert Labelle, Annie Lacasse |
A Note on a Result of Daurat and Nivat. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings, pp. 189-198, 2005, Springer, 3-540-26546-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Lattice paths, discrete regions, winding number, salient and reentrant points, polyominoes |
25 | Michael Elkin, Jian Zhang 0004 |
Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 160-168, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
almost shortest paths, streaming model, spanner |
25 | Letícia M. Peres, Silvia Regina Vergilio, Mário Jino, José Carlos Maldonado |
Path Selection in the Structural Testing: Proposition, Implementation and Application of Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCCC ![In: 21st International Conference of the Chilean Computer Science Society (SCCC 2001), 6-8 November 2001, Punta Arenas, Chile, pp. 240-246, 2001, IEEE Computer Society, 0-7695-1396-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Structural Criteria, Selection of Test Paths, Software Testing, Software Metrics |
25 | Nian-Feng Tzeng, Hsing-Lung Chen |
Fast Compaction in Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(1), pp. 50-56, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
hypercubes, fragmentation, Compaction, disjoint paths, task migration, subcubes |
25 | Khaled Day, Abdel Elah Al-Ayyoub |
Fault Diameter of k-ary n-cube Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(9), pp. 903-907, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter |
25 | Antonia Bertolino, Martina Marré |
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(12), pp. 885-899, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
program branch testing, program flowgraph, program inputs, ddgraph, graph theoretic principles, arc trees, unconstrained arcs, implied tree, recursive iteration, software analysis tool, automated testing tool, software tools, program testing, flexibility, trees (mathematics), dominance, program diagnostics, control flow analysis, simplicity, implication, program control structures, flow graphs, dominator tree, selection strategy, infeasible paths, software testing tool, path covers |
25 | John L. Schneiter, Thomas B. Sheridan |
An Automated Tactile Sensing Strategy for Planar Object Recognition and Localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(8), pp. 775-786, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
automated tactile sensing, planar object recognition, tactile exploration, point contact sensor, diagnostic measurements, sensor paths, pattern recognition, localization, tactile sensors |
24 | Olivier Coudert |
An efficient algorithm to verify generalized false paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 47th Design Automation Conference, DAC 2010, Anaheim, California, USA, July 13-18, 2010, pp. 188-193, 2010, ACM, 978-1-4503-0002-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
co-sensitization, generalized false path, timing exception, formal verification, correctness, SAT, sensitization, false path, SDC |
24 | Mehmet Hakan Karaata, Rachid Hadid |
Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, pp. 789-790, 2009, Springer, 978-3-642-05117-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Lin Xie, Azadeh Davoodi |
Bound-based identification of timing-violating paths under variability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 14th Asia South Pacific Design Automation Conference, ASP-DAC 2009, Yokohama, Japan, January 19-22, 2009, pp. 278-283, 2009, IEEE, 978-1-4244-2748-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Frank Kammer, Torsten Tholey |
The k-Disjoint Paths Problem on Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers, pp. 190-201, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Yuan Tian 0019, Ken C. K. Lee, Wang-Chien Lee |
Finding skyline paths in road networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, November 4-6, 2009, Seattle, Washington, USA, Proceedings, pp. 444-447, 2009, ACM, 978-1-60558-649-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
query processing, location-based services, skyline query, path search |
24 | Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001 |
The Induced Disjoint Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 47-61, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk |
Maximum thick paths in static and dynamic environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 20-27, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, motion planning |
24 | Partha Kanuparthy, Constantine Dovrolis, Mostafa H. Ammar |
Spectral probing, crosstalk and frequency multiplexing in internet paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Measurement Conference ![In: Proceedings of the 8th ACM SIGCOMM Internet Measurement Conference, IMC 2008, Vouliagmeni, Greece, October 20-22, 2008, pp. 291-304, 2008, ACM, 978-1-60558-334-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
frequency multiplexing, signal processing, network management, fourier transform, active probing, distributed agents |
24 | Chee-Khian Sim, Gongyun Zhao |
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 110(3), pp. 475-499, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | M. G. Karunambigai, Parvathi Rangasamy, Krassimir T. Atanassov, N. Palaniappan |
An Intuitionistic Fuzzy Graph Method for Finding the Shortest Paths in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFSA (2) ![In: Theoretical Advances and Applications of Fuzzy Logic and Soft Computing, Selection of Papers from IFSA 2007, pp. 3-10, 2007, Springer, 978-3-540-72433-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Index Matrix (IM), Intuitionistic Fuzzy Graphs (IFGs), Dynamic programming (DP), Shortest path |
24 | Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami |
An Efficient Construction of Node Disjoint Paths in OTIS Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPT ![In: Advanced Parallel Processing Technologies, 7th International Symposium, APPT 2007, Guangzhou, China, November 22-23, 2007, Proceedings, pp. 180-189, 2007, Springer, 978-3-540-76836-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Ash Mohammad Abbas, Tehzeeb Ahmed Abbasi |
An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMSWARE ![In: Proceedings of the Second International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2007), January 7-12, 2007, Bangalore, India, 2007, IEEE, 1-4244-0614-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Martin Schläffer, Elisabeth Oswald |
Searching for Differential Paths in MD4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSE ![In: Fast Software Encryption, 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers, pp. 242-261, 2006, Springer, 3-540-36597-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Li (Erran) Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo |
Routing bandwidth guaranteed paths with local restoration in label switched networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 23(2), pp. 437-449, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Qiankun Zhao, Sourav S. Bhowmick, Le Gruenwald |
Mining conserved XML query paths for dynamic-conscious caching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31 - November 5, 2005, pp. 219-220, 2005, ACM, 1-59593-140-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
XML, query, cache strategy |
24 | Shiwen Mao, Shivendra S. Panwar, Yiwei Thomas Hou |
On optimal partitioning of realtime traffic over multiple paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 13-17 March 2005, Miami, FL, USA, pp. 2325-2336, 2005, IEEE, 0-7803-8968-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Farooq Anjum |
TCP Algorithms and Multiple Paths: Considerations for the Future of the Internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Syst. Frontiers ![In: Inf. Syst. Frontiers 6(1), pp. 91-104, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
performance, TCP, multipath |
24 | Zvi Shiller, Yusuke Fujita, Dan Ophir, Yoshihiko Nakamura |
Computing a Set of Local Optimal Paths through Cluttered Environments and over Open Terrain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: Proceedings of the 2004 IEEE International Conference on Robotics and Automation, ICRA 2004, April 26 - May 1, 2004, New Orleans, LA, USA, pp. 4759-4764, 2004, IEEE. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 17726 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|