2107 search results - page 219 / 422 » Computing Small Search Numbers in Linear Time |
170
click to vote
UAI
2003
15 years 5 months ago
2003
This paper considers a method that combines ideas from Bayesian learning, Bayesian network inference, and classical hypothesis testing to produce a more reliable and robust test o...
162
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
144
click to vote
DCC
2003
IEEE
16 years 3 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
132
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
134
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...