1290 search results - page 72 / 258 » Popular Matchings: Structure and Algorithms |
109
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
141
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper introduces spherical matching to estimate dense temporal correspondence of non-rigid surfaces with genus-zero topology. The spherical domain gives a consistent 2D param...
126
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
We examine the stereo correspondence problem in the presence of slanted scene surfaces. In particular, we highlight a previously overlooked geometric fact: a horizontally slanted ...
132
click to vote
SIROCCO
2010
15 years 6 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
175
click to vote
ISMB
1994
15 years 6 months ago
1994
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...