1429 search results - page 94 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
RANLP
2003
13 years 10 months ago
2003
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
GLVLSI
2010
IEEE
13 years 9 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...