11 search results - page 2 / 3 » Skyline Queries with Noisy Comparisons |
TOC
2010
12 years 12 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
WWW
2006
ACM
14 years 6 months ago
2006
ACM
It is well known that Web-page classification can be enhanced by using hyperlinks that provide linkages between Web pages. However, in the Web space, hyperlinks are usually sparse...
ICDE
2000
IEEE
13 years 9 months ago
2000
IEEE
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
LREC
2010
13 years 6 months ago
2010
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...