Sciweavers

225 search results - page 17 / 45
» Approximating Parameterized Convex Optimization Problems
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
13 years 10 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
CEC
2007
IEEE
14 years 2 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
DISOPT
2008
138views more  DISOPT 2008»
13 years 8 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
ICRA
2008
IEEE
134views Robotics» more  ICRA 2008»
14 years 2 months ago
An optimal filtering algorithm for non-parametric observation models in robot localization
— The lack of a parameterized observation model in robot localization using occupancy grids requires the application of sampling-based methods, or particle filters. This work ad...
Jose-Luis Blanco, Javier Gonzalez, Juan-Antonio Fe...