Sciweavers

2031 search results - page 19 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
14 years 11 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...
81
Voted
EMMCVPR
1997
Springer
15 years 1 months ago
An Energy Minimization Method for Matching and Comparing Structured Object Representations
We present a general method for matching segmented parts of objects by energy minimization. The energy is designed in order to cope with possible imperfections of the compared segm...
Robert Azencott, Laurent Younes
EOR
2006
74views more  EOR 2006»
14 years 9 months ago
A set theoretic framework for enumerating matches in surveys and its application to reducing inaccuracies in vehicle roadside su
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
Richard G. Clegg
JCO
2008
102views more  JCO 2008»
14 years 9 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving
78
Voted
JUCS
2010
130views more  JUCS 2010»
14 years 8 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han