Sciweavers

ECCC
2006
96views more  ECCC 2006»
13 years 9 months ago
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
Jan Arpe, Rüdiger Reischuk
ECCC
2006
75views more  ECCC 2006»
13 years 9 months ago
Note on MAX 2SAT
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
Moses Charikar, Konstantin Makarychev, Yury Makary...
ECCC
2006
97views more  ECCC 2006»
13 years 9 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov
ECCC
2006
96views more  ECCC 2006»
13 years 9 months ago
An Unconditional Study of Computational Zero Knowledge
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
Salil P. Vadhan
ECCC
2006
88views more  ECCC 2006»
13 years 9 months ago
Some Results on Matchgates and Holographic Algorithms
Jin-yi Cai, Vinay Choudhary
ECCC
2006
58views more  ECCC 2006»
13 years 9 months ago
Scaled Dimension of Individual Strings
María López-Valdés
ECCC
2006
46views more  ECCC 2006»
13 years 9 months ago
A Complete Public-Key Cryptosystem
Dima Grigoriev, Edward A. Hirsch, Konstantin Pervy...
ECCC
2006
145views more  ECCC 2006»
13 years 9 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder