7228 search results - page 613 / 1446 » From Algorithmic to Subjective Randomness |
194
click to vote
CC
2008
Springer
15 years 7 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
215
click to vote
DAC
2009
ACM
16 years 8 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
335
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major a...
189
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Stability is an important yet under-addressed issue in feature selection from high-dimensional and small sample data. In this paper, we show that stability of feature selection ha...
187
click to vote
IUI
2009
ACM
16 years 4 months ago
2009
ACM
Many websites use tags as a mechanism for improving item metadata through collective user effort. Users of tagging systems often apply far more tags to an item than a system can ...