Sciweavers

1688 search results - page 161 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CVPR
2000
IEEE
16 years 8 months ago
Shape-Based 3D Surface Correspondence Using Geodesics and Local Geometry
This paper describes a new method for determining correspondence between points on pairs of surfaces based on shape using a combination of geodesic distance and surface curvature....
Yongmei Wang, Bradley S. Peterson, Lawrence H. Sta...
CVPR
2006
IEEE
16 years 8 months ago
Multi-View Stereo Revisited
We present an extremely simple yet robust multi-view stereo algorithm and analyze its properties. The algorithm first computes individual depth maps using a window-based voting ap...
Michael Goesele, Brian Curless, Steven M. Seitz
FOCS
2009
IEEE
16 years 22 days ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
FROCOS
2009
Springer
16 years 16 days ago
DL-Lite with Temporalised Concepts, Rigid Axioms and Roles
We investigate the temporal extension of the description logic DL-Lite(RN ) bool with the until operator on concepts, rigid (time-independent) and local (time-dependent) roles, and...
Alessandro Artale, Roman Kontchakov, Vladislav Ryz...
ICMCS
2006
IEEE
113views Multimedia» more  ICMCS 2006»
16 years 19 hour ago
Fast Multi-Reference Frame Motion Estimation via Downhill Simplex Search
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
Chen-Kuo Chiang, Shang-Hong Lai