1700 search results - page 83 / 340 » Combinatorial Pattern Matching |
SODA
2003
ACM
13 years 11 months ago
2003
ACM
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...
SODA
2004
ACM
13 years 11 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...
WEBI
2010
Springer
13 years 8 months ago
2010
Springer
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
EMMCVPR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...