2168 search results - page 66 / 434 » Randomized Algorithms and Complexity Theory |
141
click to vote
KDD
2004
ACM
15 years 8 months ago
2004
ACM
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
139
click to vote
JACM
2010
15 years 1 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
127
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
145
click to vote
SIAMDM
2008
15 years 2 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
127
click to vote
COMPGEOM
2001
ACM
15 years 6 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...