Sciweavers

105 search results - page 6 / 21
» Persistence in discrete optimization under data uncertainty
Sort
View
COMPGEOM
2006
ACM
15 years 1 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
PAMI
2002
124views more  PAMI 2002»
14 years 9 months ago
Information Theoretic Sensor Data Selection for Active Object Recognition and State Estimation
We introduce a formalism for optimal sensor parameter selection for iterative state estimation in static systems. Our optimality criterion is the reduction of uncertainty in the st...
Joachim Denzler, Christopher M. Brown
DAGM
2004
Springer
15 years 2 months ago
Predictive Discretization During Model Selection
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
Harald Steck, Tommi Jaakkola
CORR
2010
Springer
121views Education» more  CORR 2010»
14 years 9 months ago
Symmetric Allocations for Distributed Storage
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of s...
Derek Leong, Alexandros G. Dimakis, Tracey Ho
MP
2008
100views more  MP 2008»
14 years 9 months ago
Selected topics in robust convex optimization
Robust Optimization is a rapidly developing methodology for handling optimization problems affected by non-stochastic "uncertain-butbounded" data perturbations. In this p...
Aharon Ben-Tal, Arkadi Nemirovski