Sciweavers

1949 search results - page 259 / 390
» Random graphs on surfaces
Sort
View
NAACL
2010
15 years 2 months ago
Hitting the Right Paraphrases in Good Time
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
Stanley Kok, Chris Brockett
ACCV
2010
Springer
14 years 11 months ago
Learning Image Structures for Optimizing Disparity Estimation
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
M. V. Rohith, Chandra Kambhamettu
APPROX
2011
Springer
249views Algorithms» more  APPROX 2011»
14 years 4 months ago
A Canonical Form for Testing Boolean Function Properties
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
Dana Dachman-Soled, Rocco A. Servedio

Publication
400views
16 years 11 months ago
Enforcing Integrability by Error Correction using L1-minimization
Surface reconstruction from gradient fields is an important final step in several applications involving gradient manipulations and estimation. Typically, the resulting gradient ...
Dikpal Reddy, Amit K. Agrawal, Rama Chellappa
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 4 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson