332 search results - page 38 / 67 » Space Complexity vs. Query Complexity |
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
IM
2007
13 years 9 months ago
2007
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
ICDT
1995
ACM
14 years 1 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
EDBT
2011
ACM
13 years 1 months ago
2011
ACM
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...