1348 search results - page 29 / 270 » Matching planar maps |
120
Voted
DISOPT
2008
15 years 2 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
117
Voted
CVPR
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper introduces a new representation for planar curves. From the well-known Dirichlet problem for a disk, the harmonic function embedded in a circular disk is solely depende...
115
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Reconstruction of the point source of blood splatter in a crime scene is an important and difficult problem in forensic science. We study the problem of automatically reconstructi...
108
Voted
ICIAP
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
114
Voted
EDBT
2010
ACM
15 years 9 months ago
2010
ACM
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...