112 search results - page 5 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
115
click to vote
SIGIR
2012
ACM
13 years 15 days ago
2012
ACM
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
GIS
1999
ACM
15 years 2 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
EUSFLAT
2003
14 years 11 months ago
2003
In this paper, a modified fuzzy system modelling algorithm that incorporates Type 2 fuzzy sets, which is based on intervalvalued membership degrees rather than singleton membershi...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...