364 search results - page 11 / 73 » Dimension Characterizations of Complexity Classes |
ALT
1999
Springer
13 years 11 months ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
BILDMED
2007
13 years 8 months ago
2007
Abstract. The present study used 3D data on neuronal morphology images to quantitatively characterize the phenotype of transgenic neurons. We calculated the multiscale fractal dime...
DAM
1999
13 years 7 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
TIT
2010
13 years 2 months ago
2010
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...