1027 search results - page 89 / 206 » Ordered Vertex Partitioning |
143
click to vote
VISUALIZATION
2000
IEEE
15 years 10 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
153
click to vote
FOCS
1994
IEEE
15 years 9 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
167
click to vote
IAT
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
187
click to vote
IPCO
2004
15 years 6 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
134
click to vote
WSCG
2003
15 years 6 months ago
2003
This paper presents a probability method for detecting people in a static image. We simplify people as a torso and four limbs. The torso is fitted by a quadrangle, and each limb i...