Sciweavers

2168 search results - page 198 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
EWSN
2004
Springer
15 years 10 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
ICIP
2001
IEEE
16 years 6 months ago
DWT based non-parametric texture modeling
We propose a non-parametric texture modeling and synthesis technique based on the integer version of the Discrete Wavelet Transform (DWT). The successive levels of the DWT pyramid...
Gloria Menegaz
ECML
2005
Springer
15 years 10 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen
AAAI
2007
15 years 6 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ANTSW
2008
Springer
15 years 6 months ago
Modeling Phase Transition in Self-organized Mobile Robot Flocks
We implement a self-organized flocking behavior in a group of mobile robots and analyze its transition from an aligned state to an unaligned state. We briefly describe the robot an...
Ali Emre Turgut, Cristián Huepe, Hande &Cce...