11345 search results - page 1756 / 2269 » Foundations of Computer Science |
150
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
140
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
193
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
186
click to vote
MM
2006
ACM
15 years 11 months ago
2006
ACM
While there have been great advances in quantification of the genotype of organisms, including full genomes for many species, the quantification of phenotype is at a comparatively...
126
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...