451 search results - page 86 / 91 » Some Lower Bounds on Geometric Separability Problems |
STOC
2004
ACM
15 years 10 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...
78
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Protein-coding gene detection in prokaryotic genomes is considered a much simpler problem than in intron-containing eukaryotic genomes. However there have been reports...
109
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
MSN
2005
Springer
15 years 3 months ago
2005
Springer
Key pre-distribution techniques for security provision of Wireless Sensor Networks (WSNs) have attracted significant interests recently. In these schemes, a relatively small numbe...