3875 search results - page 720 / 775 » Approximation algorithms for the 0-extension problem |
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 ...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents a novel approach to the problem of determining head pose estimation and face 3D orientation of several people in low resolution sequences from multiple calibra...
173
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
148
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
DAC
2005
ACM
15 years 10 months ago
2005
ACM
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...