253 search results - page 17 / 51 » Faster Approximation of Distances in Graphs |
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
SWAT
2004
Springer
14 years 23 days ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
SGAI
2004
Springer
14 years 23 days ago
2004
Springer
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...