166 search results - page 24 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
WG
2004
Springer
14 years 1 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
PAMI
2008
13 years 7 months ago
2008
Morphological attribute filters have not previously been parallelized mainly because they are both global and nonseparable. We propose a parallel algorithm that achieves efficient ...
IPPS
2000
IEEE
14 years 2 days ago
2000
IEEE
This paper presents an efficient parallel information retrieval (IR) system which provides fast information service for the Internet users on lowcost high-performance PC-NOW enviro...
FCCM
2009
IEEE
13 years 11 months ago
2009
IEEE
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...