Sciweavers

14774 search results - page 364 / 2955
» Computational complexity and evolutionary computation
Sort
View
ALMOB
2006
80views more  ALMOB 2006»
15 years 6 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
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...
Grégory Nuel
IJCV
2006
206views more  IJCV 2006»
15 years 6 months ago
Highly Accurate Optic Flow Computation with Theoretically Justified Warping
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...
Nils Papenberg, Andrés Bruhn, Thomas Brox, ...
CPHYSICS
2007
126views more  CPHYSICS 2007»
15 years 6 months ago
Adaptive continuation algorithms for computing energy levels of rotating Bose-Einstein condensates
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 ...
S.-L. Chang, C.-S. Chien
JMLR
2008
148views more  JMLR 2008»
15 years 6 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
CONCURRENCY
2004
77views more  CONCURRENCY 2004»
15 years 6 months ago
Grids of agents for computer and telecommunication network management
The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the number and diversity of...
Marcos Dias de Assunção, Fernando Lu...