2520 search results - page 86 / 504 » The complexity of approximating entropy |
COCO
2008
Springer
15 years 8 hour ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
CEC
2007
IEEE
14 years 10 months ago
2007
IEEE
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In Image Compression, the researchers' aim is to reduce the number of bits required to represent an image by removing the spatial and spectral redundancies. Recently discrete...
150
Voted
NOMS
2010
IEEE
14 years 8 months ago
2010
IEEE
—The online detection of anomalies is a vital element of operations in data centers and in utility clouds like Amazon EC2. Given ever-increasing data center sizes coupled with th...
122
Voted
CGF
2010
14 years 8 months ago
2010
A feature-oriented generic progressive lossless mesh coder (FOLProM) is proposed to encode triangular meshes with arbitrarily complex geometry and topology. In this work, a sequen...