2060 search results - page 168 / 412 » Some Applications of Coding Theory in Computational Complexi... |
SIAMJO
2008
14 years 10 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
A novel feature extraction method, namely monogenic binary pattern (MBP), is proposed in this paper based on the theory of monogenic signal analysis, and the histogram of MBP (HMB...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
ALMOB
2006
14 years 10 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
LAWEB
2006
IEEE
15 years 4 months ago
2006
IEEE
Complex applications, in particular Web applications, deal with a myriad of different concerns and some of them affect several others. The result is that these crosscutting concer...