3652 search results - page 336 / 731 » A study of query length |
159
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
141
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
143
click to vote
TREC
2004
15 years 5 months ago
2004
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
116
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
157
click to vote
ECCC
2010
15 years 2 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...