Sciweavers

403 search results - page 41 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
ECCV
2002
Springer
14 years 11 months ago
A Probabilistic Theory of Occupancy and Emptiness
This paper studies the inference of 3D shape from a set of ? noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, ...
Rahul Bhotika, David J. Fleet, Kiriakos N. Kutulak...
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 10 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
13 years 4 months ago
Consensus-based distributed linear filtering
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
Ion Matei, John S. Baras
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 4 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
LION
2010
Springer
188views Optimization» more  LION 2010»
14 years 2 months ago
Grapheur: A Software Architecture for Reactive and Interactive Optimization
Abstract This paper proposes a flexible software architecture for interactive multiobjective optimization, with a user interface for visualizing the results and facilitating the s...
Mauro Brunato, Roberto Battiti