789 search results - page 107 / 158 » On Theory Revision with Queries |
163
click to vote
PODC
2006
ACM
16 years 6 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
191
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
153
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
140
click to vote
CIKM
2003
Springer
15 years 11 months ago
2003
Springer
Prior research into search system scalability has primarily addressed query processing efficiency [1, 2, 3] or indexing efficiency [3], or has presented some arbitrary system arch...
164
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
We examine schema mappings from a type-theoretic perspective and aim to facilitate and formalize the reuse of mappings. Starting with the mapping language of Clio, we present a ty...