CORR
2007
Springer
14 years 17 days ago
2007
Springer
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algeb...
CORR
2007
Springer
14 years 17 days ago
2007
Springer
— Decisions on sources with memory transmitted over independent channels can be taken by employing trellis calculations. In this paper, it is shown that for a certain class of fu...
CORR
2007
Springer
14 years 17 days ago
2007
Springer
CORR
2007
Springer
14 years 17 days ago
2007
Springer
CORR
2007
Springer
14 years 17 days ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
CORR
2007
Springer
14 years 17 days ago
2007
Springer
Questions of understanding and quantifying the representation and amount of information in organisms have become a central part of biological research, as they potentially hold th...
CORR
2007
Springer
14 years 17 days ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
CORR
2007
Springer
14 years 17 days ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
CORR
2007
Springer
14 years 17 days ago
2007
Springer
CORR
2007
Springer
14 years 17 days ago
2007
Springer
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on ...