Sciweavers

2031 search results - page 147 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
IPL
2002
118views more  IPL 2002»
13 years 8 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
IJCNN
2007
IEEE
14 years 2 months ago
Multi-Stage Optimal Component Analysis
— Optimal component analysis (OCA) uses a stochastic gradient optimization process to find optimal representations for general criteria and shows good performance in object reco...
Yiming Wu, Xiuwen Liu, Washington Mio
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
13 years 9 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
14 years 2 months ago
Approximate covariance estimation in graphical approaches to SLAM
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
Gian Diego Tipaldi, Giorgio Grisetti, Wolfram Burg...
UAI
2003
13 years 9 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin