Sciweavers

141 search results - page 5 / 29
» Fast probabilistic snake algorithm
Sort
View
CGF
2004
77views more  CGF 2004»
14 years 9 months ago
Stellar Mesh Simplification Using Probabilistic Optimization
This paper introduces the Stellar Simplification scheme, a fast implementation of the Four
Antônio Wilson Vieira, Thomas Lewiner, Luiz ...
IPL
2011
91views more  IPL 2011»
14 years 27 days ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
IPPS
2003
IEEE
15 years 2 months ago
A Fast Algorithm for Online Placement and Reorganization of Replicated Data
As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as...
R. J. Honicky, Ethan L. Miller
RTSS
2008
IEEE
15 years 3 months ago
Fast Sensor Placement Algorithms for Fusion-Based Target Detection
Mission-critical target detection imposes stringent performance requirements for wireless sensor networks, such as high detection probabilities and low false alarm rates. Data fus...
Zhaohui Yuan, Rui Tan, Guoliang Xing, Chenyang Lu,...
ATAL
2006
Springer
15 years 1 months ago
Adaptive Pricing for Customers with Probabilistic Valuations
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
Michael Benisch, James Andrews, Norman M. Sadeh