44 search results - page 6 / 9 » Improvement on Ha-Moon Randomized Exponentiation Algorithm |
102
Voted
COLT
2001
Springer
15 years 4 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...
INFOCOM
2007
IEEE
15 years 5 months ago
2007
IEEE
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...
125
click to vote
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
186
click to vote
ICDE
2008
IEEE
16 years 29 days ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
105
click to vote
COLING
1996
15 years 28 days ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...