Sciweavers

7150 search results - page 324 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
APPROX
2010
Springer
160views Algorithms» more  APPROX 2010»
15 years 7 months ago
Proximity Algorithms for Nearly-Doubling Spaces
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
Lee-Ad Gottlieb, Robert Krauthgamer
ORL
2006
114views more  ORL 2006»
15 years 6 months ago
A (1-1/e)-approximation algorithm for the generalized assignment problem
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
Zeev Nutov, Israel Beniaminy, Raphael Yuster
ICA
2012
Springer
14 years 2 months ago
New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
Sylvain Le Corff, Gersende Fort, Eric Moulines
ESANN
2000
15 years 8 months ago
Quantum iterative algorithm for image reconstruction problems
Iterative algorithm based on quantum tunneling is proposed by making use of mean- eld approximation. W e apply our method to the problem of BW image reconstruction (IR). Its perfor...
Jun-ichi Inoue
FOCS
2010
IEEE
15 years 4 months ago
Subexponential Algorithms for Unique Games and Related Problems
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
Sanjeev Arora, Boaz Barak, David Steurer