2168 search results - page 39 / 434 » Randomized Algorithms and Complexity Theory |
123
click to vote
KBSE
1997
IEEE
15 years 6 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
112
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
107
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
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...
125
click to vote
SIGMOD
2008
ACM
15 years 2 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
142
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
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...