226 search results - page 15 / 46 » Approximation algorithm for the kinetic robust K-center prob... |
136
Voted
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
131
Voted
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
150
click to vote
COLOGNETWENTE
2007
15 years 5 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
147
Voted
NETWORKS
2011
14 years 11 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
122
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
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...