Sciweavers

52 search results - page 2 / 11
» Learning Polynomials with Queries: The Highly Noisy Case
Sort
View
PET
2010
Springer
13 years 11 months ago
On the Privacy of Web Search Based on Query Obfuscation: A Case Study of TrackMeNot
Web Search is one of the most rapidly growing applications on the internet today. However, the current practice followed by most search engines – of logging and analyzing users...
Sai Teja Peddinti, Nitesh Saxena
ICCV
2007
IEEE
14 years 1 months ago
Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval
Given a query image of an object, our objective is to retrieve all instances of that object in a large (1M+) image database. We adopt the bag-of-visual-words architecture which ha...
Ondrej Chum, James Philbin, Josef Sivic, Michael I...
STACS
2010
Springer
14 years 2 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
CVPR
2009
IEEE
15 years 2 months ago
Co-training with Noisy Perceptual Observations
Many perception and multimedia indexing problems involve datasets that are naturally comprised of multiple streams or modalities for which supervised training data is only sparsely...
Ashish Kapoor, Chris Mario Christoudias, Raquel Ur...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 24 days ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm