2060 search results - page 39 / 412 » Some Applications of Coding Theory in Computational Complexi... |
COREGRID
2007
Springer
15 years 3 months ago
2007
Springer
This paper deals with one of the fundamental properties of grid computing – transferring code between grid nodes and executing it remotely on heterogeneous hosts. Contemporary mi...
104
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
104
click to vote
IDA
2008
Springer
14 years 9 months ago
2008
Springer
We developed Relational Data Mining approach which allows to overcome essential limitations of the Data Mining and Knowledge Discovery techniques. In the paper the approach was im...
89
Voted
CORR
2000
Springer
14 years 9 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
ICALP
2007
Springer
15 years 3 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...