Sciweavers

213 search results - page 19 / 43
» Counting Independent Sets Using the Bethe Approximation
Sort
View
PUK
2003
15 years 1 months ago
On the Decomposition and Concurrent Resolution of a Planning Problem
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
Laura Sebastia, Eva Onaindia, Eliseo Marzal
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
16 years 3 days ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
TIFS
2008
123views more  TIFS 2008»
14 years 11 months ago
A Region Ensemble for 3-D Face Recognition
In this paper, we introduce a new system for 3-D face recognition based on the fusion of results from a committee of regions that have been independently matched. Experimental resu...
Timothy C. Faltemier, Kevin W. Bowyer, Patrick J. ...
NAACL
2004
15 years 1 months ago
The Web as a Baseline: Evaluating the Performance of Unsupervised Web-based Models for a Range of NLP Tasks
Previous work demonstrated that web counts can be used to approximate bigram frequencies, and thus should be useful for a wide variety of NLP tasks. So far, only two generation ta...
Mirella Lapata, Frank Keller
FOCS
1992
IEEE
15 years 3 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra