Sciweavers

7015 search results - page 237 / 1403
» Approximation algorithms for co-clustering
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
RTSS
2002
IEEE
15 years 11 months ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
15 years 10 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala
NIPS
1998
15 years 7 months ago
Fisher Scoring and a Mixture of Modes Approach for Approximate Inference and Learning in Nonlinear State Space Models
We present Monte-Carlo generalized EM equations for learning in nonlinear state space models. The dif
Thomas Briegel, Volker Tresp
CAD
2002
Springer
15 years 6 months ago
Approximation by fat arcs and fat biarcs
A general discussion of the including approximation of a curve by a fat arc is given followed by an algorithm for constructing an including fat arc for a parametric Be
Qun Lin, Jon G. Rokne