3341 search results - page 220 / 669 » On Bounded Queries and Approximation |
156
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
181
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
167
click to vote
SIAMDM
2008
15 years 5 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
167
click to vote
VLDB
2000
ACM
15 years 9 months ago
2000
ACM
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
158
click to vote
WWW
2010
ACM
16 years 22 days ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...