6 search results - page 1 / 2 » Efficiently indexing shortest paths by exploiting symmetry i... |
EDBT
2009
ACM
13 years 8 months ago
2009
ACM
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
WEBI
2010
Springer
13 years 2 months ago
2010
Springer
Mobile is becoming a ubiquitous platform for context-aware intelligent computing. One fundamental but usually ignored issue is how to efficiently manage (e.g., index and query) the...
ECCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...