Sciweavers

2479 search results - page 318 / 496
» Quantum complexity theory
Sort
View
SIAMCOMP
2011
15 years 1 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
MSR
2011
ACM
14 years 9 months ago
A simpler model of software readability
Software readability is a property that influences how easily a given piece of code can be read and understood. Since readability can affect maintainability, quality, etc., prog...
Daryl Posnett, Abram Hindle, Premkumar T. Devanbu
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 9 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 7 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira