2374 search results - page 348 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
109
click to vote
CC
2007
Springer
15 years 2 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 ...
144
Voted
ISBI
2009
IEEE
15 years 9 months ago
2009
IEEE
—We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of...
128
click to vote
ICML
2009
IEEE
15 years 9 months ago
2009
IEEE
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
103
Voted
CCGRID
2005
IEEE
15 years 8 months ago
2005
IEEE
— The arrival of the P2P model has opened many new avenues for research within the field of distributed computing. This is mainly due to important practical features (such as su...
128
Voted
CIBCB
2006
IEEE
15 years 8 months ago
2006
IEEE
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...