4343 search results - page 650 / 869 » Improving Visual Matching |
116
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
111
click to vote
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
212
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
134
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Cardinality estimation during query optimization relies on simplifying assumptions that usually do not hold in practice. To diminish the impact of inaccurate estimates during opti...
124
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...