|
|
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 |
58 | John Hershberger 0001, Matthew Maxel, Subhash Suri |
Finding the k shortest simple paths: A new algorithm and its implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 45, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Loop-free paths, directed paths, path equivalence class, replacement paths |
58 | Angela Krstic, Kwang-Ting Cheng |
Generation of high quality tests for functional sensitizable 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. 374-379, 1995, IEEE Computer Society, 0-8186-7000-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
high quality tests, functional sensitizable paths, long paths, untestable paths, faulty conditions, test derivation, logic testing, delays, timing, integrated circuit testing, combinational circuits, combinational circuits, automatic testing, delay testing, test vectors, timing information |
54 | Huawei Li 0001, Zhongcheng Li, Yinghua Min |
Reduction of Number of Paths to be Tested in Delay Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 16(5), pp. 477-485, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
linearly independent, analytical delay model, delay testing, path sensitization |
50 | Stavroula Siachalou, Leonidas Georgiadis |
Precomputation of Constrained Widest Paths in Communication Networks. ![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. 1192-1203, 2004, Springer, 3-540-21959-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Widest Paths, Bottleneck Paths, Graph Theory, QoS Routing, Precomputation |
50 | Pratik Dave, Unmil Karadkar, Richard Furuta, Luis Francisco-Revilla, Frank M. Shipman III, Suvendu Dash, Zubin Dalal |
Browsing intricately interconnected paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hypertext ![In: HYPERTEXT 2003, Proceedings of the 14th ACM Conference on Hypertext and Hypermedia, August 26-30, 2003, Nottingham, UK, pp. 95-103, 2003, ACM, 1-58113-704-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
directed paths, navigation metaphors, path engine, path-centric browsing, Walden's paths |
49 | Ching-Wen Chen, Chung-Ping Chung |
Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 34(1), pp. 63-80, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
gamma interconnection networks, rerouting hops, collision ratio, multistage interconnection networks, disjoint paths, dynamic rerouting |
46 | Zhongtang Cai, Vibhore Kumar, Karsten Schwan |
IQ-Paths: Predictably High Performance Data Streams across Dynamic Network Overlays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPDC ![In: Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15, Paris, France, June 19-23, 2006, pp. 18-29, 2006, IEEE, 1-4244-0307-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
grid-FTP application, IQ-Paths, predictably high performance data stream, dynamic overlay network, middleware realization, online network monitoring, user-defined utility requirement, statistical analysis, scheduling algorithm, packet routing, data-intensive application, network bandwidth |
46 | Anand Srinivas, Eytan H. Modiano |
Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 11(4), pp. 401-417, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
distributed algorithmsa, energy efficiency, graph theory, wireless ad-hoc networks, multipath routing, disjoint paths |
46 | Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack |
Shortest Anisotropic Paths on Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 524-533, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
aniositropic paths, computational geometry, approximation, shortest path |
44 | Chiun-Chieh Hsu, Da-Ren Chen, Hua-Yuan Ding |
An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP ![In: Algorithms and Architectures for Parallel Processing, 9th International Conference, ICA3PP 2009, Taipei, Taiwan, June 8-11, 2009. Proceedings, pp. 638-650, 2009, Springer, 978-3-642-03094-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Forbidden paths, Shortest paths, Network flows, Labeling algorithm |
44 | Stavroula Siachalou, Leonidas Georgiadis |
Algorithms for precomputing constrained widest paths and multicast trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 13(5), pp. 1174-1187, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bottleneck paths, widest paths, widest trees, graph theory, QoS routing, multicast trees, precomputation |
44 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations on Baseline Networks with Node-Disjoint Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 737-746, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
semipermutation, baseline network, link-disjoint paths, crosstalk-free, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths |
42 | Shangming Zhu, Zhili Zhang, Xinhua Zhuang |
Modified Widest Disjoint Paths Algorithm for Multipath Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NPC ![In: Network and Parallel Computing, IFIP International Conference, NPC 2007, Dalian, China, September 18-21, 2007, Proceedings, pp. 212-219, 2007, Springer, 978-3-540-74783-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Widest disjoint paths, candidate path, width of path set, multipath routing |
42 | Bing Yang 0001, S. Q. Zheng 0001 |
Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 206-216, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
algorithm, routing, reliability, complexity, network, graph, shortest path, survival, disjoint paths |
42 | Wuping Xu, Puliu Yan, Delin Xia, Ming Wu |
Load Balancing Based on Similarity Multi-paths Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, Third International Symposium, ISPA 2005, Nanjing, China, November 2-5, 2005, Proceedings, pp. 345-357, 2005, Springer, 3-540-29769-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Traffic split, Load Balancing, Similarity, Multi-Paths Routing |
42 | Jon M. Kleinberg, Éva Tardos |
Disjoint Paths in Densely Embedded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 52-61, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
densely embedded graphs, communication paths, nearly-Eulerian graphs, locally planar interconnection networks, constant-factor approximation algorithm, maximum disjoint paths, on-line setting, routing, computational geometry, heuristics, multiprocessor interconnection networks, trees (mathematics), high-speed networks, operations research, disjoint paths, two-dimensional mesh |
41 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman |
Algorithms for fault-tolerant routing in circuit switched networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 265-274, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths |
41 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Maintaining all-pairs approximate shortest paths under deletion of edges. ![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. 394-403, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
40 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(4), pp. 383-393, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange |
40 | Yuanyuan Yang 0001, Jianchao Wang |
Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 31st International Conference on Parallel Processing (ICPP 2002), 20-23 August 2002, Vancouver, BC, Canada, pp. 239-246, 2002, IEEE Computer Society, 0-7695-1677-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
link-disjoint paths, crosstalk-free routing, Routing, interconnects, permutation, optical interconnects, multistage networks, node-disjoint paths, Latin square, all-to-all personalized exchange |
40 | Qian-Ping Gu, Shietung Peng |
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), June 3-6, 1996, Tokyo, Japan, Proceedings, pp. 98-105, 1996, IEEE Computer Society, 0-8186-7267-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
set-to-set node-disjoint paths, interconnection networks, graph theory, hypercubes, Graph algorithms, hypercube networks, undirect graphs, node-disjoint paths |
40 | Ben Kao, Hector Garcia-Molina, Daniel Barbará |
Aggressive Transmissions of Short Messages Over Redundant Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(1), pp. 102-109, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
shortmessages, replicated transmissions, fault tolerant computing, message passing, redundancy, packet switching, response time, deadlines, real time communications, packets, fault-tolerant computer systems, redundant paths, multiple paths |
40 | Sriraman Tallam, Xiangyu Zhang 0001, Rajiv Gupta 0001 |
Extending Path Profiling across Loop Backedges and Procedure Boundaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CGO ![In: 2nd IEEE / ACM International Symposium on Code Generation and Optimization (CGO 2004), 20-24 March 2004, San Jose, CA, USA, pp. 251-264, 2004, IEEE Computer Society, 0-7695-2102-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
overlapping path profiles, profile guided optimization and instruction scheduling, path profiles |
40 | How-Rern Lin, TingTing Hwang |
On determining sensitization criterion in an iterative gate sizing process. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(2), pp. 231-238, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
40 | J. Paul Myers Jr. |
Adaptive approaches to structural software testing (abstract only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 15th ACM Annual Conference on Computer Science, St. Louis, Missouri, USA, February 16-19, 1987, pp. 432, 1987, ACM, 0-89791-218-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
39 | Sun-Yuan Hsieh, Yu-Fen Weng |
Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(2), pp. 407-425, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Pairwise independent Hamiltonian paths, Hypercubes, Hamiltonian, Graph-theoretic interconnection networks, Fault-tolerant embedding |
39 | Naoki Sawada, Keiichi Kaneko, Shietung Peng |
Pairwise Disjoint Paths in Pancake Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), 3-6 December 2007, Adelaide, Australia, pp. 376-382, 2007, IEEE Computer Society, 0-7695-3049-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
interconnection networks, polynomial time algorithm, disjoint paths |
39 | Laurent D. Cohen, Thomas Deschamps |
Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, Third International Workshop, EMMCVPR 2001, Sophia Antipolis, France, September 3-5, 2001, Proceedings, pp. 560-575, 2001, Springer, 3-540-42523-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
salient curve detection, weighted distance, medical imaging, reconstruction, level sets, active contours, energy minimization, Perceptual grouping, minimal paths, fast marching |
39 | Richard Furuta, Frank M. Shipman III, Catherine C. Marshall, Donald Brenner, Hao-wei Hsieh |
Hypertext Paths and the World-Wide Web: Experiences with Walden's Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hypertext ![In: Hypertext 97, The Eigth ACM Conference on Hypertext, University of Southampton, UK, April 6-11, 1997, pp. 167-176, 1997, ACM, 0-89791-866-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
hypertext tours and paths, World Wide Web (WWW), educational applications, meta-structure, Walden's Paths |
38 | Anand Srinivas, Eytan H. Modiano |
Minimum energy disjoint path routing in wireless ad-hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking, MOBICOM 2003, 2003, San Diego, CA, USA, September 14-19, 2003, pp. 122-133, 2003, ACM, 1-58113-753-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
distributed algorithms, energy efficiency, wireless ad-hoc networks, multipath routing, disjoint paths, minimum energy |
38 | Wei-Cheng Lai, Angela Krstic, Kwang-Ting Cheng |
On Testing the Path Delay Faults of a Microprocessor Using its Instruction Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 18th IEEE VLSI Test Symposium (VTS 2000), 30 April - 4 May 2000, Montreal, Canada, pp. 15-22, 2000, IEEE Computer Society, 0-7695-0613-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Microprocessor self-testing, Path delay fault classification, Functionally testable paths, Functional tests, Delay fault testing |
38 | Therese C. Biedl, Michal Stern |
Edge-Intersection Graphs of k-Bend Paths in Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 86-95, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
38 | Peng Zhang 0008, Wenbo Zhao 0001 |
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 70-81, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Anne Vialard |
Geometrical parameters extraction from discrete paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 6th International Workshop, DCGI'96, Lyon, France, November 13-15, 1996, Proceedings, pp. 24-35, 1996, Springer, 3-540-62005-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Discrete Paths, Euclidean Paths, lenght estimation, curvature estimation |
36 | Vivekananda M. Vedula, Jacob A. Abraham |
FACTOR: A Hierarchical Methodology for Functional Test Generation and Testability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2002 Design, Automation and Test in Europe Conference and Exposition (DATE 2002), 4-8 March 2002, Paris, France, pp. 730-734, 2002, IEEE Computer Society, 0-7695-1471-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Lei Shi, Vandana Pursnani Janeja |
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP). ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, pp. 767-776, 2009, ACM, 978-1-60558-495-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
anomalous window discovery, intersecting paths, scan statistic, traffic accidents |
36 | Petr A. Golovach, Dimitrios M. Thilikos |
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 210-221, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms |
36 | Patricia Mouy, Bruno Marre, Nicky Williams, Pascale Le Gall |
Generation of All-Paths Unit Test with Function Calls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICST ![In: First International Conference on Software Testing, Verification, and Validation, ICST 2008, Lillehammer, Norway, April 9-11, 2008, pp. 32-41, 2008, IEEE Computer Society, 978-0-7695-3127-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
all-paths unit test, unit test with function calls, unit test, constraint solving, structural testing, automatic generation, testing C programs |
36 | Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi |
Preferential path profiling: compactly numbering interesting paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007, pp. 351-362, 2007, ACM, 1-59593-575-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
preferential paths, profiling, dynamic analysis, arithmetic coding |
36 | Minh Ngoc Ngo, Hee Beng Kuan Tan |
Detecting large number of infeasible paths through recognizing their patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESEC/SIGSOFT FSE ![In: Proceedings of the 6th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2007, Dubrovnik, Croatia, September 3-7, 2007, pp. 215-224, 2007, ACM, 978-1-59593-811-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
empirical properties, static analysis, structural testing, coverage analysis, infeasible paths |
36 | Sun-Yuan Hsieh |
Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes. ![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. 373-379, 2006, Springer, 3-540-40056-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
pairwise independent Hamiltonian paths, Interconnection networks, hypercubes, Hamiltonian, fault-tolerant embedding |
36 | Bing Yang 0001, Mei Yang, Jianping Wang 0001, S. Q. Zheng 0001 |
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 8th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2005, December 7-9. 2005, Las Vegas, Nevada, USA, pp. 334-339, 2005, IEEE Computer Society, 0-7695-2509-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
algorithm, reliability, complexity, Networks, graph, shortest path, survivability, network flow, protection, disjoint paths, minimum cost network flow |
34 | Nastooh Taheri Javan, Mehdi Dehghan 0001 |
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSN ![In: Mobile Ad-Hoc and Sensor Networks, Third International Conference, MSN 2007, Beijing, China, December 12-14, 2007, Proceedings, pp. 715-724, 2007, Springer, 978-3-540-77023-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Zone-Disjoint Paths, MANET, Routing Algorithms, Multi-Path Routing |
34 | Qian-Ping Gu, Shietung Peng |
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), Cancun, Mexico, May 1-5, 2000, pp. 761-768, 2000, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
multistage interconnection networks, Permutation routing, all-optical networks, node-disjoint paths, wavelength routing, BPC permutations |
34 | Yuval Emek, David Peleg, Liam Roditty |
A near-linear time algorithm for computing replacement paths in planar directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 428-435, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
34 | Zhongtang Cai, Vibhore Kumar, Karsten Schwan |
IQ-Paths: Predictably High Performance Data Streams Across Dynamic Network Overlays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Grid Comput. ![In: J. Grid Comput. 5(2), pp. 129-150, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Statistical prediction, Grid, Overlay network, High performance, Self-management, Available bandwidth, Data-intensive applications, Self-regulating |
34 | I-De Huang, Sandeep K. Gupta 0001 |
Selection of Paths for Delay Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 14th Asian Test Symposium (ATS 2005), 18-21 December 2005, Calcutta, India, pp. 208-215, 2005, IEEE Computer Society, 0-7695-2481-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Yun Shao 0002, Sudhakar M. Reddy, Irith Pomeranz, Seiji Kajihara |
On Selecting Testable Paths in Scan Designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 19(4), pp. 447-456, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
testable path, delay testing, delay fault, path delay fault, path selection |
34 | Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong |
The stable paths problem and interdomain routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 10(2), pp. 232-243, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
path vector protocols, stable routing, BGP, Border Gateway Protocol, interdomain routing, internet routing |
34 | Srihari Nelakuditi, Zhi-Li Zhang |
On Selection of Paths for Multipath Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWQoS ![In: Quality of Service - IWQoS 2001, 9th International Workshop Karlsruhe, Germany, June 6-8, 2001, Proceedings, pp. 170-186, 2001, Springer, 3-540-42217-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Unmil Karadkar, Luis Francisco-Revilla, Richard Furuta, Frank M. Shipman III |
Structuring Access to a Dynamic Collection of Digital Documents: The Walden's Paths Vitual Directories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DDEP/PODDP ![In: Digital Documents: Systems and Principles, 8th International Conference on Digital Documents and Electronic Publishing, DDEP 2000, 5th International Workshop on the Principles of Digital Document Processing, PODDP 2000, Munich, Germany, September 13-15, 2000, Revised Papers, pp. 91-103, 2000, Springer, 3-540-21070-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Seiji Kajihara, Kozo Kinoshita, Irith Pomeranz, Sudhakar M. Reddy |
A Method for Identifying Robust Dependent and Functionally Unsensitizable Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 10th International Conference on VLSI Design (VLSI Design 1997), 4-7 January 1997, Hyderabad, India, pp. 82-87, 1997, IEEE Computer Society, 0-8186-7755-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
robust dependent path, local circuit analysis, logic circuit testing, functionally unsensitizable path, timing, logic circuits |
33 | Irith Pomeranz, Sudhakar M. Reddy |
Test enrichment for path delay faults using multiple sets of target faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(1), pp. 82-90, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | João L. Sobrinho |
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 10(4), pp. 541-550, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
quality of service, internet, Internet, routing, algebra |
33 | Michael K. Reiter, Stuart G. Stubblebine |
Toward Acceptable Metrics of Authentication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
S&P ![In: 1997 IEEE Symposium on Security and Privacy, May 4-7, 1997, Oakland, CA, USA, pp. 10-20, 1997, IEEE Computer Society, 0-8186-7828-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
authentication metrics design, trusted intermediaries, intersecting paths, key interdependencies, certificates, ambiguities, message authentication, large-scale system, confidence, acceptability, multiple paths |
32 | Jason J. Holdsworth, Siu Man Lui |
GPS-enabled mobiles for learning shortest paths: a pilot study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FDG ![In: Proceedings of the 4th International Conference on Foundations of Digital Games, FDG 2009, Orlando, Florida, USA, April 26-30, 2009, pp. 86-90, 2009, ACM, 978-1-60558-437-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
GPS-enabled mobile phones, mobile learning, problem-based learning, shortest paths algorithm |
32 | David Avis, Bohdan Kaluzny |
Computing monotone disjoint paths on polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(4), pp. 328-343, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy |
32 | Sungwoo Tak, E. K. Park |
Restoration performance study of k-shortest disjoint paths in WDM optical networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 34(1-2), pp. 13-26, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Shortest disjoint paths, Dynamic programming principle, Optimization, Restoration, WDM optical networks |
32 | Michael Elkin |
Computing almost shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(2), pp. 283-323, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
almost shortest paths, Graph algorithms, spanners |
32 | Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack |
Determining approximate shortest paths on weighted polyhedral surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(1), pp. 25-53, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces |
32 | Changming Sun, Ben Appleton |
Multiple Paths Extraction in Images Using a Constrained Expanded Trellis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 27(12), pp. 1923-1933, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Multiple paths extraction, constrained expanded trellis, feature extraction, object segmentation |
32 | Damien Joseph, Soon Ang, Sandra Slaughter |
Identifying the prototypical career paths of IT professionals: a sequence and cluster analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPR ![In: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research 2005, Atlanta, Georgia, USA, April 14-16, 2005, pp. 94-96, 2005, ACM, 1-59593-011-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
sequence analysis, longitudinal, IT profession, career paths |
32 | Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink |
Testing Homotopy for Paths in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 31(1), pp. 61-81, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Simple paths, Computational topology, Homotopy |
32 | Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki |
Finding Edge-Disjoint Paths in Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 26(1), pp. 3-30, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Polynomial-time algorithm, Edge-coloring, Edge-disjoint paths, Partial k -tree, Bounded treewidth |
32 | Eugene Goldberg, Alexander Saldanha |
Timing Analysis with Implicitly Specified False Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 13th International Conference on VLSI Design (VLSI Design 2000), 4-7 January 2000, Calcutta, India, pp. 518-522, 2000, IEEE Computer Society, 0-7695-0487-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
known false paths, implicit false path representation, timing analysis, breadth-first search |
32 | Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki |
Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 203-212, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree |
31 | Ali Asghar Khavasi, Nastooh Taheri Javan |
Using zone-disjoint multi-path routing algorithm for video transmission over ad-hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 877-882, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
video multi-path transmission, zone-disjoint paths, MANET, multi-path routing |
31 | Deepayan Chakrabarti, Rupesh R. Mehta |
The paths more taken: matching DOM trees to search logs for accurate webpage clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 19th International Conference on World Wide Web, WWW 2010, Raleigh, North Carolina, USA, April 26-30, 2010, pp. 211-220, 2010, ACM, 978-1-60558-799-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
clustering, wrapper induction, search logs |
31 | Yoshinori Kitatsuji, Masato Tsuru, Tetsuya Takine, Yuji Oie |
Flow assignment method with traffic characteristics over multiple paths for reducing queuing delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 37(1-3), pp. 97-108, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Flow assignment, Traffic engineering, Queuing delay, Traffic characteristics |
31 | Antoine B. Bagula, Anthony E. Krzesinski |
Traffic Engineering Label Switched Paths in IP Networks using a Pre-Planned Flow Optimization Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: 9th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2001), 15-18 August 2001, Cincinnati, OH, USA, pp. 70-, 2001, IEEE Computer Society, 0-7695-1315-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | R. Iris Bahar, Hyunwoo Cho, Gary D. Hachtel, Enrico Macii, Fabio Somenzi |
Symbolic timing analysis and resynthesis for low power of combinational circuits containing false paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(10), pp. 1101-1115, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
31 | How-Rern Lin, TingTing Hwang |
Dynamical identification of critical paths for iterative gate sizing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1994, San Jose, California, USA, November 6-10, 1994, pp. 481-484, 1994, IEEE Computer Society / ACM, 0-89791-690-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Edith Cohen |
Fast algorithms for constructing t-spanners and paths with stretch t ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 648-658, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
pairwise-covers, t-spanners constructions, paths with stretch, minimum-weight path, weighted undirected graph, exact shortest paths algorithms, randomized algorithm, deterministic algorithm, vertices, weighted graph |
31 | John Hershberger 0001, Subhash Suri |
Efficient Computation of Euclidean Shortest Paths in the Plane ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 508-517, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
plane computational geometry, polygonal obstacles, shortest paths, time complexity, Euclidean shortest paths, efficient computation, worst-case time |
31 | David R. Karger, Daphne Koller, Steven J. Phillips |
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 560-568, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
path-comparison-based algorithm, hidden paths algorithm, edge weights, lower bound, time bounds, weighted graphs, all-pairs shortest paths |
31 | Samir Khuller, Baruch Schieber |
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 288-293, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
k-edge disjoint paths, testing connectivity, disjoint s-t paths, optimal speedup algorithm, k-vertex connectivity, parallel algorithms, graphs, CRCW PRAM |
31 | Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani |
Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 300-305, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
disjoint paths problem, Kuratowski homeomorph, vertex-disjoint paths, NC planarity algorithms, processor-time product, routing, parallel algorithms, sequential algorithm, planar embedding, polylogarithmic factor |
30 | Shun-Yen Lu, Pei-Ying Hsieh, Jing-Jia Liou |
Exploring linear structures of critical path delay faults to reduce test efforts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2006 International Conference on Computer-Aided Design, ICCAD 2006, San Jose, CA, USA, November 5-9, 2006, pp. 100-106, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Marwan A. Gharaybeh, Vishwani D. Agrawal, Michael L. Bushnell, Carlos G. Parodi |
False-Path Removal Using Delay Fault Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 16(5), pp. 463-476, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
design for testability, fault simulation, Delay testing, path delay faults, synthesis for testability, redundancy removal |
30 | Shmuel Zaks |
On the Use of Duality and Geometry in Layouts for ATM Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 114-131, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen |
Cycle time and slack optimization for VLSI-chips. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1999 IEEE/ACM International Conference on Computer-Aided Design, 1999, San Jose, California, USA, November 7-11, 1999, pp. 232-238, 1999, IEEE Computer Society, 0-7803-5832-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
30 | Huawei Li 0001, Zhongcheng Li, Yinghua Min |
Delay Testing with Double Observations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 7th Asian Test Symposium (ATS '98), 2-4 December 1998, Singapore, pp. 96-, 1998, IEEE Computer Society, 0-8186-8277-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
linearly independent, test generation, observation, delay testing |
30 | L. Howard Holley, Barry K. Rosen |
Qualified Data Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, USA, January 1980, pp. 68-82, 1980, ACM Press, 0-89791-011-7. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
29 | I-De Huang, Yi-Shing Chang, Sandeep K. Gupta 0001, Sreejit Chakravarty |
An Industrial Case Study of Sticky Path-Delay Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 26th IEEE VLSI Test Symposium (VTS 2008), April 27 - May 1, 2008, San Diego, California, USA, pp. 395-402, 2008, IEEE Computer Society, 978-0-7695-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
sticky paths, timing false paths, path reprioritization, delay testing, test quality |
29 | Sung-Woo Chang, Hyoung-Joo Kim |
SOPView+: an object browser which supports navigating database by changing base object. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 21st International Computer Software and Applications Conference (COMPSAC '97), 11-15 August 1997, Washington, DC, USA, pp. 100-103, 1997, IEEE Computer Society, 0-8186-8105-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
SOPView+, object browser, large database navigation, base object, forward navigation, reference paths, backward navigation, reference hierarchy, screen real estate problem, extended synchronized browsing, online front-ends, navigational paths |
29 | Tse-Yun Feng, Yanggon Kim |
Fault-diagnosis for a class of distributed control multistage interconnection networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTDCS ![In: 5th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS 1995), August 28-30, 1995, Chenju, Korea, Proceedings, pp. 284-293, 1995, IEEE Computer Society, 0-8186-7125-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
distributed control multistage interconnection networks, multiple disjoint paths, input/output terminals, fault-diagnosis method, self-routing tags, fault-location procedure, performance evaluation, fault-tolerance, fault-diagnosis, fault tolerant computing, multistage interconnection networks, fault location, redundant paths |
29 | Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer |
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 251-262, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Network Pricing Games, Communication Networks, Stackelberg Games, Shortest Paths Tree |
29 | Himanshu Gupta, Rephael Wenger |
Constructing pairwise disjoint paths with few links. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(3), pp. 26, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Link paths, isomorphic triangulations, noncrossing, polygon |
29 | Zareen Alamgir, Sarmad Abbasi |
Combinatorial Algorithms for Listing Paths in Minimal Change Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers, pp. 112-130, 2007, Springer, 978-3-540-77293-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Minimal change order, Revolving door order, Generation of paths, Combinatorial algorithms, Complete graph |
29 | Emerson Ribeiro de Mello, Aad P. A. van Moorsel, Joni da Silva Fraga |
Evaluation of P2P Search Algorithms for Discovering Trust Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPEW ![In: Formal Methods and Stochastic Models for Performance Evaluation, Fourth European Performance Engineering Workshop, EPEW 2007, Berlin, Germany, September 27-28, 2007, Proceedings, pp. 112-124, 2007, Springer, 978-3-540-75210-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Peer-to-Peer, Web of Trust, Trust Paths |
29 | Qing Xu 0002, Mateu Sbert |
A New Way to Re-using Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings, Part II, pp. 741-750, 2007, Springer, 978-3-540-74475-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Reusing paths, Ray tracing, Global Illumination, Monte Carlo |
29 | Roberto Ardon, Laurent D. Cohen |
Fast Constrained Surface Extraction by Minimal Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 69(1), pp. 127-136, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
active contours, level set method, object extraction, minimal paths, active surfaces |
29 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-disjoint paths in Planar graphs with constant congestion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 757-766, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Planar graphs, multicommodity flow, edge-disjoint paths |
29 | Hiroyuki Iwata, Tomokazu Yoneda, Satoshi Ohtake, Hideo Fujiwara |
A DFT Method for RTL Data Paths Based on Partially Strong Testability to Guarantee Complete Fault Efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 14th Asian Test Symposium (ATS 2005), 18-21 December 2005, Calcutta, India, pp. 306-311, 2005, IEEE Computer Society, 0-7695-2481-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
strong testability, partially strong testability, complete fault efficiency, design-for-testability, data paths |
29 | Roberto Ardon, Laurent D. Cohen, Anthony J. Yezzi |
A New Implicit Method for Surface Segmentation by Minimal Paths: Applications in 3D Medical Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, 5th International Workshop, EMMCVPR 2005, St. Augustine, FL, USA, November 9-11, 2005, Proceedings, pp. 520-535, 2005, Springer, 3-540-30287-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Stationary Transport Equation, Image segmentation, Active contours, Level Set method, Object Extraction, Minimal Paths |
29 | Keiichi Kaneko |
Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, Second InternationalSymposium, ISPA 2004, Hong Kong, China, December 13-15, 2004, Proceedings, pp. 556-567, 2004, Springer, 3-540-24128-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
node-to-set disjoint paths problem, bi-rotator graphs, fault tolerance, parallel computation |
29 | Toshinori Hosokawa, Hiroshi Date, Masahide Miyazaki, Michiaki Muraoka, Hideo Fujiwara |
A Method of Test Plan Grouping to Shorten Test Length for RTL Data Paths under a Test Controller Area Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 12th Asian Test Symposium (ATS 2003), 17-19 November 2003, Xian, China, pp. 130-135, 2003, IEEE Computer Society, 0-7695-1951-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
test plan grouping, test controllers, partly compacted test plan tables, RTL data paths, test length |
29 | Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh |
Constructing One-to-Many Disjoint Paths in Folded Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 51(1), pp. 33-45, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
folded hypercube, Rabin number, hypercube, optimization problem, Disjoint paths |
29 | Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink |
Testing Homotopy for paths in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 160-169, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
simple paths, computational topology, Homotopy |
29 | Thomas Deschamps, Laurent D. Cohen |
Minimal Paths in 3D Images and Application to Virtual Endoscopy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (2) ![In: Computer Vision - ECCV 2000, 6th European Conference on Computer Vision, Dublin, Ireland, June 26 - July 1, 2000, Proceedings, Part II, pp. 543-557, 2000, Springer, 3-540-67686-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Medical image understanding, Deformable Models, Level Set methods, Minimal paths, Fast Marching, Eikonal Equation |
Displaying result #1 - #100 of 17726 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|