166 search results - page 10 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
SC
2003
ACM
14 years 28 days ago
2003
ACM
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
ECCV
2010
Springer
14 years 6 days ago
2010
Springer
In this paper, we propose Partition min-Hash (PmH), a novel hashing scheme for discovering partial duplicate images from a large database. Unlike the standard min-Hash algorithm th...
CASES
2006
ACM
13 years 11 months ago
2006
ACM
Packet classification is crucial for the Internet to provide more value-added services and guaranteed quality of service. Besides hardware-based solutions, many software-based cla...