Sciweavers

2498 search results - page 316 / 500
» Algorithms for the Topological Watershed
Sort
View
TON
2008
125views more  TON 2008»
13 years 8 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
13 years 6 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
TON
2010
171views more  TON 2010»
13 years 3 months ago
Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...
Yan Wu, Zhoujia Mao, Sonia Fahmy, Ness B. Shroff
TVCG
2012
184views Hardware» more  TVCG 2012»
11 years 10 months ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan
CVPR
2001
IEEE
14 years 10 months ago
On Computing Exact Visual Hulls of Solids Bounded by Smooth Surfaces
This paper presents a method for computing the visual hull that is based on two novel representations: the rim mesh, which describes the connectivity of contour generators on the ...
Svetlana Lazebnik, Edmond Boyer, Jean Ponce