4110 search results - page 816 / 822 » Efficient algorithms for the 2-gathering problem |
104
Voted
WWW
2006
ACM
16 years 11 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...
WWW
2006
ACM
16 years 11 days ago
2006
ACM
In this paper, we define and study a novel search problem: Comparative Web Search (CWS). The task of CWS is to seek relevant and comparative information from the Web to help users...
WWW
2005
ACM
16 years 11 days ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
113
Voted
WWW
2005
ACM
16 years 11 days ago
2005
ACM
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
KDD
2008
ACM
16 years 3 days ago
2008
ACM
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...