17366 search results - page 3181 / 3474 » New Revision Algorithms |
201
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
164
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
268
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
278
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
259
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...