Sciweavers

51 search results - page 5 / 11
» Iterative construction of the optimal Bermudan stopping time
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
NIPS
2001
13 years 9 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan
CAD
2006
Springer
13 years 8 months ago
A sweepline algorithm for Euclidean Voronoi diagram of circles
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative...
Li Jin, Donguk Kim, Lisen Mu, Deok-Soo Kim, Shi-Mi...
ECML
2005
Springer
14 years 1 months ago
Inducing Hidden Markov Models to Model Long-Term Dependencies
We propose in this paper a novel approach to the induction of the structure of Hidden Markov Models. The induced model is seen as a lumped process of a Markov chain. It is construc...
Jérôme Callut, Pierre Dupont
EUROGRAPHICS
2010
Eurographics
13 years 9 months ago
Fast and Efficient Skinning of Animated Meshes
Skinning is a simple yet popular deformation technique combining compact storage with efficient hardware accelerated rendering. While skinned meshes (such as virtual characters) a...
Ladislav Kavan, Peter-Pike Sloan, Carol O'Sullivan