15 search results - page 1 / 3 » On the Hardness of Learning with Rounding over Small Modulus |
100
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
103
Voted
MM
2005
ACM
15 years 6 months ago
2005
ACM
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...
109
click to vote
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
121
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
111
Voted
KDD
2001
ACM
16 years 1 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...