40 search results - page 4 / 8 » Combinatorial Laplacian of the Matching Complex |
BIS
2008
13 years 7 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
ICCV
2007
IEEE
14 years 7 months ago
2007
IEEE
We propose a novel framework for consistent correspondence between arbitrary manifold meshes. Different from most existing methods, our approach directly maps the connectivity of ...
IJCV
2006
13 years 5 months ago
2006
This paper studies the problem of matching two unsynchronized video sequences of the same dynamic scene, recorded by different stationary uncalibrated video cameras. The matching i...