Sciweavers

76 search results - page 15 / 16
» Agnostically Learning Halfspaces
Sort
View
WWW
2010
ACM
13 years 7 months ago
Classification-enhanced ranking
Many have speculated that classifying web pages can improve a search engine's ranking of results. Intuitively results should be more relevant when they match the class of a q...
Paul N. Bennett, Krysta Marie Svore, Susan T. Duma...
CCS
2010
ACM
13 years 7 months ago
PinDr0p: using single-ended audio features to determine call provenance
The recent diversification of telephony infrastructure allows users to communicate through landlines, mobile phones and VoIP phones. However, call metadata such as Caller-ID is ei...
Vijay A. Balasubramaniyan, Aamir Poonawalla, Musta...
FOCS
2007
IEEE
14 years 1 months ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket
AAAI
2008
13 years 9 months ago
A Fast Data Collection and Augmentation Procedure for Object Recognition
When building an application that requires object class recognition, having enough data to learn from is critical for good performance, and can easily determine the success or fai...
Benjamin Sapp, Ashutosh Saxena, Andrew Y. Ng
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
13 years 11 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman