10608 search results - page 714 / 2122 » Complexity of O'Hara's Algorithm |
205
click to vote
CC
2007
Springer
15 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
282
click to vote
COMPGEOM
2011
ACM
14 years 11 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
222
click to vote
GIS
2010
ACM
15 years 6 months ago
2010
ACM
This paper proposes an efficient, decentralized algorithm for determining the topological relationship between two regions monitored by a geosensor network. Many centralized algo...
251
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
154
click to vote
CVPR
1999
IEEE
16 years 9 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...