3341 search results - page 437 / 669 » On Bounded Queries and Approximation |
197
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
181
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In this paper, we uncover the Bloom paradox in Bloom filters: sometimes, it is better to disregard the query results of Bloom filters, and in fact not to even query them, thus...
192
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
302
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
186
click to vote
TOIS
2008
15 years 6 months ago
2008
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over multip...