CORR
2008
Springer
14 years 17 days ago
2008
Springer
CORR
2008
Springer
14 years 17 days ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
CORR
2008
Springer
14 years 17 days ago
2008
Springer
CORR
2008
Springer
14 years 17 days ago
2008
Springer
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...
CORR
2008
Springer
14 years 17 days ago
2008
Springer
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...
CORR
2008
Springer
14 years 17 days ago
2008
Springer
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...
CORR
2008
Springer
14 years 17 days ago
2008
Springer
CORR
2008
Springer
14 years 17 days ago
2008
Springer
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
CORR
2008
Springer
14 years 17 days ago
2008
Springer
This paper proposes a novel Nyquist-rate analog-to-digital (A/D) conversion algorithm which achieves exponential accuracy in the bit-rate despite using imperfect components. The p...
CORR
2008
Springer
14 years 17 days ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...