2693 search results - page 161 / 539 » On Computing Complex Navigation Functions |
167
click to vote
ASIACRYPT
2005
Springer
16 years 1 days ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
186
click to vote
CEC
2007
IEEE
15 years 6 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...
157
click to vote
ALMOB
2006
15 years 6 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
150
click to vote
IJCV
2006
15 years 6 months ago
2006
In this paper, we suggest a variational model for optic flow computation based on non-linearised and higher order constancy assumptions. Besides the common grey value constancy ass...
157
click to vote
CPHYSICS
2007
15 years 6 months ago
2007
We describe adaptive continuation algorithms for computing energy levels of the Bose–Einstein condensates (BEC) with emphasis on the rotating BEC. We show that the rotating BEC ...