2957 search results - page 319 / 592 » The Complexity of Polynomial-Time Approximation |
204
click to vote
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
172
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
165
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
355
click to vote
IWSOS
2011
Springer
14 years 9 months ago
2011
Springer
Abstract This paper depicts and evaluates an evolutionary design process for generating a complex self-organizing multicellular system based on Cellular Automata (CA). We extend th...
181
click to vote
ESA
2004
Springer
16 years 10 hour ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...