Sciweavers

8094 search results - page 321 / 1619
» Improvements in Formula Generalization
Sort
View
POPL
2008
ACM
16 years 6 months ago
A theory of platform-dependent low-level software
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
Marius Nita, Dan Grossman, Craig Chambers
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 10 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
JCT
2011
90views more  JCT 2011»
15 years 1 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
196
Voted
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 8 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
RECOMB
2006
Springer
16 years 6 months ago
Markov Additive Chains and Applications to Fragment Statistics for Peptide Mass Fingerprinting
Abstract. Peptide mass fingerprinting is a technique to identify a protein from its fragment masses obtained by mass spectrometry after enzymatic digestion. Recently, much attentio...
Hans-Michael Kaltenbach, Sebastian Böcker, Sv...