1804 search results - page 336 / 361 » Ranking for data repairs |
WWW
2007
ACM
16 years 15 days ago
2007
ACM
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
104
click to vote
WWW
2006
ACM
16 years 15 days ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
105
click to vote
KDD
2008
ACM
16 years 7 days ago
2008
ACM
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
KDD
2007
ACM
16 years 7 days ago
2007
ACM
Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely ...
107
click to vote
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...