3637 search results - page 17 / 728 » On Dynamic Bit-Probe Complexity |
ICIP
2005
IEEE
15 years 8 months ago
2005
IEEE
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...
142
Voted
INFOCOM
2010
IEEE
15 years 23 days ago
2010
IEEE
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...
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
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 ...
108
Voted
PERCOM
2010
ACM
15 years 21 days ago
2010
ACM
—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...
ISCAS
2007
IEEE
15 years 8 months ago
2007
IEEE
— 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...