Sciweavers

895 search results - page 148 / 179
» Approximate convex decomposition
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
14 years 9 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
MP
2008
135views more  MP 2008»
14 years 9 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
TASE
2008
IEEE
14 years 9 months ago
Sensor Selection in Arbitrary Dimensions
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
Volkan Isler, Malik Magdon-Ismail
140
Voted
TSP
2008
91views more  TSP 2008»
14 years 9 months ago
Nonlinear and Nonideal Sampling: Theory and Methods
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...
Tsvi G. Dvorkind, Yonina C. Eldar, Ewa Matusiak
MP
2002
110views more  MP 2002»
14 years 9 months ago
Robust optimization - methodology and applications
Abstract. Robust Optimization (RO) is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known ...
Aharon Ben-Tal, Arkadi Nemirovski