Sciweavers

887 search results - page 46 / 178
» Locally definable homotopy
Sort
View
ICPR
2002
IEEE
15 years 10 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
81
Voted
IPMI
2007
Springer
15 years 10 months ago
Regional Appearance in Deformable Model Segmentation
Automated medical image segmentation is a challenging task that benefits from the use of effective image appearance models. In this paper, we compare appearance models at three reg...
Joshua Stough, Robert E. Broadhurst, Stephen M. Pi...
109
Voted
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
15 years 10 months 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
HICSS
1994
IEEE
126views Biometrics» more  HICSS 1994»
15 years 1 months ago
Automating Compensation in a Multidatabase
Compensation is the process by which a committed transaction in a database is undone by running the semantic inverse of that transaction on the database. Compensation has been pro...
Marian H. Nodine, Stanley B. Zdonik
APPROX
2008
Springer
90views Algorithms» more  APPROX 2008»
14 years 11 months ago
Tensor Products of Weakly Smooth Codes Are Robust
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...
Eli Ben-Sasson, Michael Viderman