Sciweavers

3894 search results - page 202 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 6 months ago
Approximating Multi-Criteria Max-TSP
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...
Markus Bläser, Bodo Manthey, Oliver Putz
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
16 years 25 days 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
15 years 7 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
ICASSP
2008
IEEE
16 years 29 days ago
Collusion-aware traitor tracing in multimedia fingerprinting using sparse signal approximation
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
David P. Varodayan, Christine Pépin
ECCC
2000
140views more  ECCC 2000»
15 years 6 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis