1272 search results - page 16 / 255 » Approximate Parameterized Matching |
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Abstract. Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main ...
RT
2001
Springer
15 years 1 months ago
2001
Springer
We introduce hybrid rendering, a scheme that dynamically ray traces the local geometry of reflective and refractive objects, but approximates more distant geometry by hardwaresupp...
74
Voted
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
101
Voted
GEOINFO
2007
14 years 11 months ago
2007
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
SGP
2004
14 years 12 months ago
2004
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...