A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally ef...
Fragkiskos Papadopoulos, Dmitri V. Krioukov, Mari&...
Spectral voice conversion is usually performed using a single model selected in order to represent a tradeoff between goodness of fit and complexity. Recently, we proposed a new ...
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
Korbinian Frank, Patrick Robertson, Sergio Fortes ...
— This paper further investigates and answers two fundamental questions in the complex dynamical networks: i) how many nodes should a general complex dynamical network with fixe...