Sciweavers

3897 search results - page 135 / 780
» complexity 2010
Sort
View
MOC
2010
13 years 5 months ago
Computation of conformal representations of compact Riemann surfaces
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
Guillermo López Lagomasino, Domingo Pestana...
ANOR
2010
82views more  ANOR 2010»
13 years 10 months ago
Time-based detection of changes to multivariate patterns
Detection of changes to multivariate patterns is an important topic in a number of different domains. Modern data sets often include categorical and numerical data and potentially...
Jing Hu, George C. Runger
IWEC
2010
13 years 11 months ago
Emotions: The Voice of the Unconscious
In the paper the idea is presented that emotions are the result of a high dimensional optimization process happening in the unconscious mapped onto the low dimensional conscious. I...
Matthias Rauterberg
APAL
2010
125views more  APAL 2010»
13 years 10 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 9 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...