2588 search results - page 132 / 518 » Applications of Kolmogorov complexity to computable model th... |
145
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
A novel particle filter, the Memory-based Particle Filter
(M-PF), is proposed that can visually track moving objects
that have complex dynamics. We aim to realize robustness
aga...
129
click to vote
FQAS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The task of similarity search is widely used in various areas of computing, including multimedia databases, data mining, bioinformatics, social networks, etc. For a long ...
136
Voted
EUROGP
2007
Springer
15 years 3 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
135
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
130
click to vote
FSTTCS
2008
Springer
15 years 2 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...