398 search results - page 2 / 80 » Critical exponents of graphs |
ICNC
2005
Springer
14 years 3 months ago
2005
Springer
Fingertip pulsations (plethysmograms) were found to obey chaotic dynamics [1]. We applied chaos theory to analysis of the time series of plethysmograms under various human physio-p...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
TSP
2010
13 years 4 months ago
2010
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
FOCS
1991
IEEE
14 years 1 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
ESA
2004
Springer
14 years 3 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...