900 search results - page 31 / 180 » On Polynomial Time Computation over Unordered Structures |
RECOMB
2009
Springer
14 years 9 months ago
2009
Springer
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
COLT
2001
Springer
14 years 1 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
EUROCRYPT
2009
Springer
14 years 9 months ago
2009
Springer
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
ICALP
2011
Springer
13 years 12 days ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...