166 search results - page 20 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
EUROPAR
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
DBKDA
2010
IEEE
14 years 24 days ago
2010
IEEE
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Rendering high-quality computer animations requires intensive computation, and therefore a large amount of time. One way to speed up this process is to devise rendering algorithms...
ALENEX
2003
13 years 9 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...