Sciweavers

3049 search results - page 482 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 9 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 8 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
ICCV
2003
IEEE
14 years 11 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
INFOCOM
2003
IEEE
14 years 2 months ago
Cooperation in Wireless Ad Hoc Networks
— In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the b...
Vikram Srinivasan, Pavan Nuggehalli, Carla-Fabiana...
SIAMSC
2010
141views more  SIAMSC 2010»
13 years 7 months ago
An Iterative Method for Edge-Preserving MAP Estimation When Data-Noise Is Poisson
In numerous applications of image processing, e.g. astronomical and medical imaging, data-noise is well-modeled by a Poisson distribution. This motivates the use of the negative-lo...
Johnathan M. Bardsley, John Goldes