Sciweavers

1027 search results - page 89 / 206
» Ordered Vertex Partitioning
Sort
View
VISUALIZATION
2000
IEEE
14 years 2 months ago
New techniques for topologically correct surface reconstruction
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,...
Udo Adamy, Joachim Giesen, Matthias John
FOCS
1994
IEEE
14 years 1 months ago
Finding the k Shortest Paths
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...
David Eppstein
IAT
2009
IEEE
14 years 1 months ago
Developing a Deterministic Patrolling Strategy for Security Agents
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
Nicola Basilico, Nicola Gatti, Francesco Amigoni
IPCO
2004
144views Optimization» more  IPCO 2004»
13 years 11 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
WSCG
2003
101views more  WSCG 2003»
13 years 11 months ago
Probability Estimation for People Detection
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...
Qingjie Sun, Enhua Wu