2520 search results - page 197 / 504 » The complexity of approximating entropy |
104
click to vote
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
Building models of the structure in musical signals raises the question of how to evaluate and compare different modeling approaches. One possibility is to use the model to impute...
124
click to vote
CICLING
2012
Springer
13 years 6 months ago
2012
Springer
The positional rigidity of graphemes (as well as words considered as single units) in written sequences has been analyzed in this paper using complex network methodology. In partic...
FOCS
2000
IEEE
15 years 3 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
GECCO
2008
Springer
15 years 4 days ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
102
click to vote
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...