1686 search results - page 229 / 338 » Programs as polygraphs: computability and complexity |
162
click to vote
CVPR
2010
IEEE
16 years 13 days ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
131
click to vote
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
Many bioinformatics studies require the analysis of RNA or DNA structures. More specifically, extensive work is done to elaborate efficient algorithms able to predict the 2-D fold...
135
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
146
click to vote
SI3D
2005
ACM
15 years 9 months ago
2005
ACM
We present a sampling strategy and rendering framework for intersectable models, whose surface is implicitly defined by a black box intersection test that provides the location a...
179
click to vote
CAPTECH
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...