Sciweavers

2031 search results - page 3 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
TIT
2011
209views more  TIT 2011»
13 years 4 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
14 years 2 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
AMDO
2006
Springer
14 years 1 months ago
Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional Scaling
We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an a...
Alexander M. Bronstein, Michael M. Bronstein, Alfr...
BMVC
2010
13 years 7 months ago
Generalized Descriptor Compression for Storage and Matching
Smarter phones have made handheld computer vision a reality, but limited bandwidth, storage space and processing power prevent mobile phones from leveraging the full body of exist...
Matthew Johnson
ICCVW
1999
Springer
14 years 2 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson