2889 search results - page 178 / 578 » Querying Structured Hyperdocuments |
EMNLP
2011
12 years 8 months ago
2011
We propose a general method to watermark and probabilistically identify the structured outputs of machine learning algorithms. Our method is robust to local editing operations and...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
The core task of sponsored search is to retrieve relevant ads for the user’s query. Ads can be retrieved either by exact match, when their bid term is identical to the query, or...
DBVIS
1993
14 years 11 days ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...