Sciweavers

2479 search results - page 421 / 496
» Quantum complexity theory
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 11 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 10 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
CHI
2007
ACM
14 years 10 months ago
Software or wetware?: discovering when and why people use digital prosthetic memory
Our lives are full of memorable and important moments, as well as important items of information. The last few years have seen the proliferation of digital devices intended to sup...
Steve Whittaker, Vaiva Kalnikaité
POPL
2003
ACM
14 years 10 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 10 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld