85 search results - page 6 / 17 » Fast and practical indexing and querying of very large graph... |
102
click to vote
SIGMOD
2012
ACM
13 years 21 hour ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
102
click to vote
MIR
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
101
click to vote
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a new system, called Retimm, for searching databases made of documents containing images and text. Images are indexed by colour and texture distributions.. Colour and t...