1536 search results - page 36 / 308 » Approximately Dominating Representatives |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
ALMOB
2006
13 years 7 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The construction of low-dimensional models explaining highdimensional signal observations provides concise and efficient data representations. In this paper, we focus on pattern ...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
IPCO
2004
13 years 9 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...