420 search results - page 36 / 84 » Search on High Degree Graphs |
98
Voted
TPDS
1998
15 years 11 days ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Due to the high performance of recent computer graphics hardware, 3D CG and CG animations have become in great demand for various applications. Many 3D models have already been cr...
228
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
124
Voted
AIPS
2004
15 years 2 months ago
2004
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
114
click to vote
EDBT
2006
ACM
16 years 26 days ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...