Sciweavers

406 search results - page 34 / 82
» Gadgets, Approximation, and Linear Programming
Sort
View
CVPR
2010
IEEE
13 years 8 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
MP
1998
109views more  MP 1998»
13 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
DSN
2009
IEEE
14 years 4 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni
FOCS
2006
IEEE
14 years 3 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
CCCG
2010
13 years 11 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...