459 search results - page 65 / 92 » Computational Complexity of Probabilistic Disambiguation |
97
Voted
ICCV
1999
IEEE
16 years 1 months ago
1999
IEEE
Two basic problems in image interpretation are: a) determining which interpretations are the most plausible amoungst many possibilities; and b) controlling the search for plausibl...
ICML
2004
IEEE
16 years 17 days ago
2004
IEEE
Traditional non-parametric statistical learning techniques are often computationally attractive, but lack the same generalization and model selection abilities as state-of-the-art...
126
click to vote
PODC
2009
ACM
16 years 9 days ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
ICAI
2007
15 years 1 months ago
2007
Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular...
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...