|
|
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 |
19 | Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong |
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 36(3), pp. 321-331, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
rectilinear metric, Computational geometry, shortest paths, minimum spanning trees, Steiner trees, obstacles |
19 | Bhabani P. Sinha, Bhargab B. Bhattacharya, Suranjan Ghose, Pradip K. Srimani |
A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 35(11), pp. 1000-1004, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
parallel algorithms, pipelining, shortest paths, VLSI architecture, Diameter |
19 | Krishna Kant 0001 |
Finding Interferences Between Rectangular Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 34(11), pp. 1045-1049, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
rectangular paths, routing, intersection, Backtrack, overlap |
19 | Gopal Lakhani |
An Improved Distribution Algorithm for Shortest Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 33(9), pp. 855-857, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
shortest paths computation, Distributed algorithms, pipelining, VLSI layout, systolic architecture |
18 | S. Mehdi Hashemi, Shaghayegh Mokarami, Ebrahim Nasrabadi |
Dynamic shortest path problems with time-varying costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 4(1), pp. 147-156, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Time-varying networks, Labeling algorithms, Dynamic shortest paths |
18 | Sophie Stellmach, Lennart E. Nacke, Raimund Dachselt |
Advanced gaze visualizations for three-dimensional virtual environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETRA ![In: Proceedings of the 2010 Symposium on Eye-Tracking Research & Applications, ETRA 2010, Austin, Texas, USA, March 22-24, 2010, pp. 109-112, 2010, ACM, 978-1-60558-994-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
attentional maps, gaze visualizations, virtual environments, eye tracking, eye movements, three-dimensional, scan paths |
18 | Piet Van Mieghem, Huijuan Wang |
The observable part of a network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(1), pp. 93-105, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
union of shortest paths, observability, overlay |
18 | Tadao Takaoka |
Partial Solution and Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 700-711, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
adaptive sort, minimal mergesort, ascending runs, nearly acyclic graphs, complexity, entropy, shortest paths, minimum spanning trees |
18 | Manohar B. Srikanth, P. C. Mathias, Vijay Natarajan, Prakash Naidu, Timothy Poston |
Visibility volumes for interactive path optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 24(7-9), pp. 635-647, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Flight paths, Force-directed ropes, Haptics, Multimodal interaction, Visibility analysis |
18 | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee |
Two Variations of the Minimum Steiner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 101-120, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time |
18 | Stelios Neophytou, Maria K. Michael, Spyros Tragoudas |
Test set enhancement for quality transition faults using function-based methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 15th ACM Great Lakes Symposium on VLSI 2005, Chicago, Illinois, USA, April 17-19, 2005, pp. 182-187, 2005, ACM, 1-59593-057-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
high quality test, ATPG, delay test, critical paths, transition fault, test compaction |
18 | Felipe S. Marques 0001, Renato P. Ribas, Sachin S. Sapatnekar, André Inácio Reis |
A new approach to the use of satisfiability in false path detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 15th ACM Great Lakes Symposium on VLSI 2005, Chicago, Illinois, USA, April 17-19, 2005, pp. 308-311, 2005, ACM, 1-59593-057-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
unateness, satisfiability, false paths |
18 | Stavros G. Kolliopoulos, Clifford Stein 0001 |
Approximating disjoint-path problems using packing integer programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 99(1), pp. 63-87, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
packing integer programs, approximation algorithms, edge-disjoint paths |
18 | Sudip Misra, B. John Oommen |
Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Innovations in Applied Artificial Intelligence, 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2004, Ottawa, Canada, May 17-20, 2004. Proceedings, pp. 239-248, 2004, Springer, 3-540-22007-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Intelligent Systems, Learning Automata, Dynamic Shortest Paths |
18 | Islene C. Garcia, Luiz Eduardo Buzato |
On the Minimal Characterization of the Rollback-Dependency Trackability Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), Phoenix, Arizona, USA, April 16-19, 2001, pp. 342-349, 2001, IEEE Computer Society, 0-7695-1077-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
zigzag paths, fault-tolerance, Distributed algorithms, rollback recovery, distributed checkpointing |
18 | Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya |
A Blocked All-Pairs Shortest-Path Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 419-432, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
cache, blocking, speedup, All pairs shortest paths |
18 | Jing-Jia Liou, Kwang-Ting Cheng, Deb Aditya Mukherjee |
Path Selection for Delay Testing of Deep Sub-Micron Devices Using Statistical Performance Sensitivity Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 18th IEEE VLSI Test Symposium (VTS 2000), 30 April - 4 May 2000, Montreal, Canada, pp. 97-104, 2000, IEEE Computer Society, 0-7695-0613-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
delay defects, delay fault modeling, delay testing, critical paths, statistical timing analysis |
18 | Qian-Ping Gu, Shietung Peng |
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: Proceedings of the 2000 International Conference on Parallel Processing, ICPP 2000, Toronto, Canada, August 21-24, 2000, pp. 513-520, 2000, IEEE Computer Society, 0-7695-0768-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
WDM all-optical networks, routing algorithms, multistage interconnection networks, Permutation routing, edge-disjoint paths, BPC permutations |
18 | Theodora A. Varvarigou, Miltiades E. Anagnostou, Sudhir R. Ahuja |
Reconfiguration Models and Algorithms for Stateful Interactive Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 25(3), pp. 401-415, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Reconfiguration of stateful processes, compensation paths, optimal centralized algorithms, suboptimal distributed and hybrid algorithms, polynomial-time algorithms |
18 | Jean-Pierre Braquelaire, Anne Vialard |
A new antialiasing approach for image compositing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 13(5), pp. 218-227, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Discrete regions, Discrete contours, Euclidean paths, Antialiasing, Image compositing |
18 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks |
On the totalk-diameter of connection networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 96-106, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network |
18 | Mikkel Thorup |
Undirected Single Source Shortest Path in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 12-21, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
single source shortest paths problem, algorithmic graph theory, deterministic linear time, hierarchical bucketing, deterministic algorithms, linear time, weighted graph, Dijkstra's algorithm, linear space |
18 | Ananta K. Majhi, James Jacob, Lalit M. Patnaik, Vishwani D. Agrawal |
On test coverage of path delay faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 9th International Conference on VLSI Design (VLSI Design 1996), 3-6 January 1996, Bangalore, India, pp. 418-421, 1996, IEEE Computer Society, 0-8186-7228-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
two-pass test generation method, falling transition, line delay test, longest sensitizable path, decreasing length, redundant stuck-at fault, computational complexity, fault diagnosis, logic testing, delays, redundancy, combinational circuits, fault simulation, circuit analysis computing, test coverage, path delay faults, benchmark circuits, coverage metric, combinational logic circuits, longest paths |
18 | Lance R. Williams, David W. Jacobs |
Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: Procedings of the Fifth International Conference on Computer Vision (ICCV 95), Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, June 20-23, 1995, pp. 408-415, 1995, IEEE Computer Society, 0-8186-7042-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
stochastic completion fields, illusory contour shape, boundary completion shape, mammalian visual cortex, boundary fragments, vector-field convolutions, maximum likelihood paths, curves of least energy, illusory contours, illusory contour stimuli, computational geometry, probability, edge detection, image recognition, random walk, computer model, lattice, neural nets, maximum likelihood estimation, probability distribution, neural model, image plane |
18 | Michele Flammini, Giorgio Gambosi, Sandro Salomone |
On Devising Boolean Routing Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings, pp. 222-236, 1995, Springer, 3-540-60618-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
shortest paths representation, Parallel and distributed systems, compact routing tables |
18 | Frank Thomson Leighton, Bruce M. Maggs |
Fast algorithms for finding O(congestion+dilation) packet routing schedules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 555-563, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
packet routing schedules, fixed edge-simple paths, constant-size queues, algorithm parallelization, parallel algorithms, computational complexity, multiprocessor interconnection networks, packet switching, congestion, processor scheduling, telecommunication network routing, fast algorithms, dilation, Lovasz local lemma |
18 | Habib Youssef, Sadiq M. Sait, Khaled Nassar, Muhammad S. T. Benten |
Performance driven standard-cell placement using the genetic algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 5th Great Lakes Symposium on VLSI (GLS-VLSI '95), March 16-18, 1995, The State University of New York at Buffalo, USA, pp. 124-127, 1995, IEEE Computer Society, 0-8186-7035-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
connection length, timing-driven placer, /spl alpha/-criticality, delay performance improvement, genetic algorithms, genetic algorithm, delays, timing, logic CAD, circuit layout CAD, cellular arrays, integrated circuit layout, critical paths, area, propagation delays, wire length, timing performance, IC design, standard-cell placement |
18 | Alexander Saldanha, Narendra V. Shenoy, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli |
Functional clock schedule optimization. ![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. 93-98, 1995, IEEE Computer Society, 0-8186-6905-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
clock schedule optimization, time frames, level-sensitive sequential circuits, scheduling, delays, delays, timing, sequential circuits, flip-flops, clocks, circuit optimisation, latches, false paths |
18 | Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz |
Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(3), pp. 247-263, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
adaptive minimal deadlock-free packet routing, virtual cut-through routing models, simulations, algorithms, concurrency control, message passing, hypercubes, multiprocessor interconnection networks, multiprocessor interconnection networks, meshes, packet switching, parallel machines, parallel machines, routing algorithms, deadlock, packet routing, shuffle-exchange, minimal paths, two-dimensional mesh |
18 | Khaled Day, Anand R. Tripathi |
A Comparative Study of Topological Properties of Hypercubes and Star Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(1), pp. 31-38, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
networktopology, interconnection network topologies, comparativestudy, parallel paths, asymptotically balanced, balanced spanning trees, graph theory, graph theory, hypercubes, multiprocessor interconnection networks, hypercube networks, spanning trees, star graphs, greedy |
18 | Mee Yee Chan, Francis Y. L. Chin |
A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(8), pp. 933-946, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
grid mapping, 2D grids, embedding strategy, minimal dilation, communication paths, grid-neighbors, node congestion, parallel algorithm, parallel algorithms, parallelization, hypercubes, hypercube networks |
18 | Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu |
On the Parallel Computation of the Algebraic Path Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 3(2), pp. 251-256, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
all pairsshortest paths, reconfigurable bus system, repeated matrix multiplications, parallel algorithms, computational complexity, parallel computation, graph theory, minimum spanning tree, transitive closure, processor array, CRCW PRAM, graph problems, algebraic path problem |
18 | Yu Cai 0002 |
A thin-layer protocol for utilizing multiple paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 11-15, 2009, St. Louis, MO, USA, pp. 1049-1054, 2009, IEEE, 978-1-4244-3803-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Steven D. Prager, William M. Spears |
A hybrid evolutionary-graph approach for finding functional network paths. ![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. 306-315, 2009, ACM, 978-1-60558-649-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
functional routes, multicriteria shortest path, street networks, routing |
18 | Yang Cao, Chunhua Hu, Luming Li |
Search-based multi-paths test data generation for structure-oriented testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GEC Summit ![In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC Summit 2009, Shanghai, China, June 12-14, 2009, pp. 25-32, 2009, ACM, 978-1-60558-326-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
structure-oriented, genetic algorithms, software testing, automation test, path testing |
18 | Julien Mille, Laurent D. Cohen |
Geodesically Linked Active Contours: Evolution Strategy Based on Minimal Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSVM ![In: Scale Space and Variational Methods in Computer Vision, Second International Conference, SSVM 2009, Voss, Norway, June 1-5, 2009. Proceedings, pp. 163-174, 2009, Springer, 978-3-642-02255-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Vasilis F. Pavlidis, Giovanni De Micheli |
Power distribution paths in 3-D ICS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 19th ACM Great Lakes Symposium on VLSI 2009, Boston Area, MA, USA, May 10-12 2009, pp. 263-268, 2009, ACM, 978-1-60558-522-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
power distribution network, 3-D ICS, 3-D integration, through silicon vias |
18 | Eddie Cheng 0001, Shuhong Gao, Ke Qiu 0001, Zhizhang Shen |
On Disjoint Shortest Paths Routing on the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 375-383, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Torsten Tholey |
Improved Algorithms for the 2-Vertex Disjoint Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings, pp. 546-557, 2009, Springer, 978-3-540-95890-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Yanghua Xiao, Wentao Wu 0001, Jian Pei, Wei Wang 0009, Zhenying He |
Efficiently indexing shortest paths by exploiting symmetry in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2009, 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, March 24-26, 2009, Proceedings, pp. 493-504, 2009, ACM, 978-1-60558-422-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Chunrong Song, Spyros Tragoudas |
Identification of Critical Executable Paths at the Architectural Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(12), pp. 2291-2302, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Dian Fan, Yee Sin Chan, Xunqi Yu, James W. Modestino |
Network-adaptive transport of motion-compensated fine granularity scalability video using multiple asymmetric paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the International Conference on Image Processing, ICIP 2008, October 12-15, 2008, San Diego, California, USA, pp. 2320-2323, 2008, IEEE, 978-1-4244-1765-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral disjoint paths packing. ![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. 446-454, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Mahesh Mohan, Rahul Sawhney, K. Madhava Krishna, K. Srinathan, Manohar B. Srikanth |
Covering hostile terrains with partial and complete visibilities: On minimum distance paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, September 22-26, 2008, Acropolis Convention Center, Nice, France, pp. 2572-2577, 2008, IEEE, 978-1-4244-2057-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Ling Xu, Anthony Stentz |
Blended local planning for generating safe and feasible paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, September 22-26, 2008, Acropolis Convention Center, Nice, France, pp. 709-716, 2008, IEEE, 978-1-4244-2057-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Xuefeng Yin, Gerhard Steinböck, Gunvor Elisabeth Kirkelund, Troels Pedersen, Peter Blattnig, A. Jaquier, Bernard H. Fleury |
Tracking of Time-Variant Radio Propagation Paths Using Particle Filtering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 920-924, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Liam Roditty, Asaf Shapira |
All-Pairs Shortest Paths with a Sublinear Additive Error. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 622-633, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Yuuri Sugihara, Yohei Kume, Kazutoshi Kobayashi, Hidetoshi Onodera |
Performance optimization by track swapping on critical paths utilizing random variations for FPGAS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: FPL 2008, International Conference on Field Programmable Logic and Applications, Heidelberg, Germany, 8-10 September 2008, pp. 503-506, 2008, IEEE, 978-1-4244-1961-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Alireza Esfahani, Morteza Analoui |
Widest K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSSE (4) ![In: International Conference on Computer Science and Software Engineering, CSSE 2008, Volume 4: Embedded Programming / Database Technology / Neural Networks and Applications / Other Applications, December 12-14, 2008, Wuhan, China, pp. 1032-1035, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Irith Pomeranz, Sudhakar M. Reddy |
Design-for-Testability for Improved Path Delay Fault Coverage of Critical Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 21st International Conference on VLSI Design (VLSI Design 2008), 4-8 January 2008, Hyderabad, India, pp. 175-180, 2008, IEEE Computer Society, 0-7695-3083-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Dimitris Sacharidis, Kostas Patroumpas, Manolis Terrovitis, Verena Kantere, Michalis Potamias, Kyriakos Mouratidis, Timos K. Sellis |
On-line discovery of hot motion paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2008, 11th International Conference on Extending Database Technology, Nantes, France, March 25-29, 2008, Proceedings, pp. 392-403, 2008, ACM, 978-1-59593-926-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | B. John Oommen, Sudip Misra, Ole-Christoffer Granmo |
Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(7), pp. 959-976, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Random races, algorithms, routing, traffic engineering, MPLS |
18 | Zhenjiang Li, J. J. Garcia-Luna-Aceves |
Finding multi-constrained feasible paths by using depth-first search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 13(3), pp. 323-334, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multi-constrained path selection, Success ratio, Existence percentage, Competitive ratio, Depth-first search |
18 | Ammar W. Mohemmed, Nirod Chandra Sahoo, Tan Kim Geok |
A new particle swarm optimization based algorithm for solving shortest-paths tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 3221-3225, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Mongkol Ekpanyapong, Xin Zhao 0001, Sung Kyu Lim |
An Efficient Computation of Statistically Critical Sequential Paths Under Retiming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 12th Conference on Asia South Pacific Design Automation, ASP-DAC 2007, Yokohama, Japan, January 23-26, 2007, pp. 547-552, 2007, IEEE Computer Society, 1-4244-0629-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Gaëtan Mourmant, Mike Gallivan |
How personality type influences decision paths in the unfolding model of voluntary job turnover: an application to IS professionals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPR ![In: Proceedings of the 2007 ACM SIGMIS CPR Conference on Computer Personnel Research 2007, April 19-21, 2007, St. Louis, Missouri, USA, pp. 134-143, 2007, ACM, 978-1-59593-641-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Myers-Briggs personality type, Myers-Briggs type indicator (MBTI), job turnover, unfolding model of turnover |
18 | Nikolaos G. Bourbakis, Raj Patil |
A Methodology for Automatically Detecting Texture Paths and Patterns in Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI (1) ![In: 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), October 29-31, 2007, Patras, Greece, Volume 1, pp. 504-512, 2007, IEEE Computer Society, 0-7695-3015-X. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Virginia Vassilevska, Ryan Williams 0001, Raphael Yuster |
All-pairs bottleneck paths for general graphs in truly sub-cubic time. ![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. 585-589, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
bottleneck path, maximum capacity path, matrix multiplication, subcubic |
18 | I. Chen, Mabo Robert Ito |
Relaxed Failure Recovery Process for Reliable Quality-of-Service using Unreserved Backup Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 21st International Conference on Advanced Information Networking and Applications (AINA 2007), May 21-23, 2007, Niagara Falls, Canada, pp. 962-969, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Matthieu Petit, Arnaud Gotlieb |
Uniform Selection of Feasible Paths as a Stochastic Constraint Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QSIC ![In: Seventh International Conference on Quality Software (QSIC 2007), 11-12 October 2007, Portland, Oregon, USA, pp. 280-285, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Danny Z. Chen, Ewa Misiolek |
Finding Many Optimal Paths Without Growing Any Optimal Path Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 232-242, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Janardhan R. Iyengar, Paul D. Amer, Randall R. Stewart |
Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 14(5), pp. 951-964, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
load balancing, multipath, SCTP, load sharing, transport layer, end-to-end |
18 | Sudip Misra, B. John Oommen |
An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(6), pp. 686-702, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
stochastic graphs, Routing, dynamic, learning automata, all pairs shortest path |
18 | Chi Hong Cheong, Man Hon Wong 0001 |
Mining Popular Paths in a Transportation Database System with Privacy Protection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE Workshops ![In: Proceedings of the 22nd International Conference on Data Engineering Workshops, ICDE 2006, 3-7 April 2006, Atlanta, GA, USA, pp. 122, 2006, IEEE Computer Society, 0-7695-2571-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Satish Rao, Shuheng Zhou |
Edge Disjoint Paths in Moderately Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 202-213, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Nighat Yasmin |
Incremental computation of shortest paths in semi-dynamic graphs using software components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 44st Annual Southeast Regional Conference, 2006, Melbourne, Florida, USA, March 10-12, 2006, pp. 96-101, 2006, ACM, 1-59593-315-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
semi-dynamic graphs, specification, shortest path, software component, incremental computation |
18 | Yu-Liang Chi, Hsun-Ming Lee |
Building Conceptual Knowledge for Managing Learning Paths in e-Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KSEM ![In: Knowledge Science, Engineering and Management, First International Conference, KSEM 2006, Guilin, China, August 5-8, 2006, Proceedings, pp. 66-77, 2006, Springer, 3-540-37033-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Ontology, Semantic, e-Learning, Conceptual structure |
18 | Krzysztof Walkowiak |
A New Function for Optimization of Working Paths in Survivable MPLS Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIS ![In: Computer and Information Sciences - ISCIS 2006, 21th International Symposium, Istanbul, Turkey, November 1-3, 2006, Proceedings, pp. 424-433, 2006, Springer, 3-540-47242-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Chao Peng, Hong Shen |
An Improved Approximation Algorithm for Computing Disjoint QoS Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN/ICONS/MCL ![In: Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 23-29 April 2006, Mauritius, pp. 10, 2006, IEEE Computer Society, 0-7695-2552-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Yoshinori Kitatsuji, Satoshi Katsuno, Masato Tsuru, Tetsuya Takine, Yuji Oie |
On Flow Distribution over Multiple Paths Based on Traffic Characteristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: Information Networking, Advances in Data Communications and Wireless Networks, International Conference, ICOIN 2006, Sendai, Japan, January 16-19, 2006, Revised Selected Papers, pp. 483-492, 2006, Springer, 3-540-48563-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Vlado Vorisek, Bruce Swanson, Kun-Han Tsai, Dhiraj Goswami |
Improved Handling of False and Multicycle Paths in ATPG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 24th IEEE VLSI Test Symposium (VTS 2006), 30 April - 4 May 2006, Berkeley, California, USA, pp. 160-165, 2006, IEEE Computer Society, 0-7695-2514-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Keiichi Kaneko, Shietung Peng |
Disjoint Paths Routing in Pancake Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), 4-7 December 2006, Taipei, Taiwan, pp. 254-259, 2006, IEEE Computer Society, 0-7695-2736-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
External-memory exact and approximate all-pairs shortest-paths in undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 735-744, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Carsten Maple, Jon Hitchcock |
A Novel Scalable Parallel Algorithm for Finding Optimal Paths over Heterogeneous Terrain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: 9th International Conference on Information Visualisation, IV 2005, 6-8 July 2005, London, UK, pp. 664-669, 2005, IEEE Computer Society, 0-7695-2397-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Annamária Kovács |
Polynomial Time Preemptive Sum-Multicoloring on Paths. ![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. 840-852, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Abhik Roychoudhury, Tulika Mitra, Hemendra Singh Negi |
Analyzing Loop Paths for Execution Time Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCIT ![In: Distributed Computing and Internet Technology, Second International Conference, ICDCIT 2005, Bhubaneswar, India, December 22-24, 2005, Proceedings, pp. 458-469, 2005, Springer, 3-540-30999-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Kazuhiro Kazama, Shin-ya Sato, Kensuke Fukuda, Ken-ichiro Murakami, Hiroshi Kawakami, Osamu Katai |
Evaluation of Using Human Relationships on the Web as Information Navigation Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JSAI Workshops ![In: New Frontiers in Artificial Intelligence, Joint JSAI 2005 Workshop Post-Proceedings, pp. 302-313, 2005, Springer, 3-540-35470-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Stephen Herborn |
Building media overlay service paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoNEXT ![In: Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2005, Toulouse, France, October 24-27, 2005, pp. 252-253, 2005, ACM, 1-59593-197-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
media routing, context awareness, service composition |
18 | Fernando A. Kuipers, Huijuan Wang, Piet Van Mieghem |
The stability of paths in a dynamic network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoNEXT ![In: Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2005, Toulouse, France, October 24-27, 2005, pp. 105-114, 2005, ACM, 1-59593-197-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
link weight perturbation, link-state update policy, quality of service, shortest path, network dynamics |
18 | Said Hoceini, Abdelhamid Mellouk, Yacine Amirat |
K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN (2) ![In: Networking - ICN 2005, 4th International Conference on Networking, ReunionIsland, France, April 17-21, 2005, Proceedings, Part II, pp. 164-172, 2005, Springer, 3-540-25338-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap |
k-Link Shortest Paths in Weighted Subdivisions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 325-337, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Maarten Marx |
First Order Paths in Ordered Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings, pp. 114-128, 2005, Springer, 3-540-24288-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | M. Sabry Hassouna, Aly A. Farag, Robert Falk |
Differential Fly-Throughs (DFT): A General Framework for Computing Flight Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICCAI ![In: Medical Image Computing and Computer-Assisted Intervention - MICCAI 2005, 8th International Conference, Palm Springs, CA, USA, October 26-29, 2005, Proceedings, Part I, pp. 654-661, 2005, Springer, 3-540-29327-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Irit Katriel, Pascal Van Hentenryck |
Maintaining Longest Paths in Cyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 358-372, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic |
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers, pp. 49-62, 2004, Springer, 3-540-27873-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Maren Martens, Martin Skutella |
Flows on Few Paths: Algorithms and Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 520-531, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Mateu Sbert, Francesc Castro, John H. Halton |
Reuse of Paths in Light Source Animation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Graphics International ![In: 2004 Computer Graphics International (CGI 2004), 16-19 June 2004, Crete, Greece, pp. 532-535, 2004, IEEE Computer Society, 0-7695-2171-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Joseph S. B. Mitchell, Micha Sharir |
New results on shortest paths in three dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 124-133, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
shortest path, NP-hardness, motion planning, terrain |
18 | Zoé Lacroix, Louiqa Raschid, Maria-Esther Vidal |
Efficient Techniques to Explore and Rank Paths in Life Science Data Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DILS ![In: Data Integration in the Life Sciences, First International Workshop, DILS 2004, Leipzig, Germany, March 25-26, 2004, Proceedings, pp. 187-202, 2004, Springer, 3-540-21300-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Abdulrahman H. Altalhi, Golden G. Richard III |
Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PerCom Workshops ![In: 2nd IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2004 Workshops), 14-17 March 2004, Orlando, FL, USA, pp. 81-86, 2004, IEEE Computer Society, 0-7695-2106-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Jian Zhang 0001 |
Symbolic Execution of Program Paths Involving Pointer and Structure Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QSIC ![In: 4th International Conference on Quality Software (QSIC 2004), 8-10 September 2004, Braunschweig, Germany, pp. 87-92, 2004, IEEE Computer Society, 0-7695-2207-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Sergei Bespamyatnikh |
Encoding Homotopy of Paths in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 329-338, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Cindy Eisner, Dana Fisman, John Havlicek, Yoad Lustig, Anthony McIsaac, David Van Campenhout |
Reasoning with Temporal Logic on Truncated Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings, pp. 27-39, 2003, Springer, 3-540-40524-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Víctor M. Jiménez, Andrés Marzal |
A Lazy Version of Eppstein's K Shortest Paths Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings, pp. 179-190, 2003, Springer, 3-540-40205-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Aleksandrs Slivkins |
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 482-493, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Mustapha Kchikech, Olivier Togni |
Paths Coloring Algorithms in Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings, pp. 193-202, 2003, Springer, 3-540-40505-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Dong Xiang, Shan Gu, Hideo Fujiwara |
Non-Scan Design for Testability for Mixed RTL Circuits with Both Data Paths and Controller via Conflict Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 12th Asian Test Symposium (ATS 2003), 17-19 November 2003, Xian, China, pp. 300-305, 2003, IEEE Computer Society, 0-7695-1951-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Gunyoung Koh, Duyoung Oh, Heekyoung Woo |
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Human.Society@Internet 2003 ![In: Web Communication Technologies and Internet-Related Social Issues - HSI 2003, Second International Conference on Human Society@Internet, Seoul, Korea, June 18-20, 2003, Proceedings, pp. 323-331, 2003, Springer, 3-540-40456-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Ya-Hui Chang, Cheng-Ta Lee |
Supporting Selection-Projection XQuery Processing Based on Encoding Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Eighth International Conference on Database Systems for Advanced Applications (DASFAA '03), March 26-28, 2003, Kyoto, Japan, pp. 241-248, 2003, IEEE Computer Society, 0-7695-1895-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | D. V. Sreenath, William I. Grosky, Farshad Fotouhi |
Emergent Semantics from Users' Browsing Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISI ![In: Intelligence and Security Informatics, First NSF/NIJ Symposium, ISI 2003, Tucson, AZ, USA, June 2-3, 2003, Proceedings, pp. 355-357, 2003, Springer, 3-540-40189-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #401 - #500 of 17726 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|