Sciweavers

1272 search results - page 61 / 255
» Approximate Parameterized Matching
Sort
View
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
15 years 3 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...
CVPR
2001
IEEE
16 years 1 months ago
Rectifying Transformations That Minimize Resampling Effects
Image rectification is the process of warping a pair of stereo images in order to align the epipolar lines with the scan-lines of the images. Once a pair of images is rectified, s...
Joshua Gluckman, Shree K. Nayar
93
Voted
SAC
2010
ACM
15 years 6 months ago
Variable ranges in linear constraints
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
Salvatore Ruggieri, Fred Mesnard
97
Voted
INTERACT
2003
15 years 15 days ago
A Hierarchical Keyframe User Interface for Browsing Video over the Internet
: We present an interactive content-based video browser allowing fast, non linear and hierarchical navigation of video over the Internet through multiple levels of key-frames that ...
Maël Guillemot, Pierre Wellner, Daniel Gatica...
CSCLP
2007
Springer
15 years 5 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...