Sciweavers

2588 search results - page 72 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 5 months ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli
CVPR
2010
IEEE
1790views Computer Vision» more  CVPR 2010»
15 years 10 months ago
Data Driven Mean-Shift Belief Propagation For non-Gaussian MRFs
We introduce a novel data-driven mean-shift belief propagation (DDMSBP) method for non-Gaussian MRFs, which often arise in computer vision applications. With the aid of scale sp...
Minwoo Park, S. Kashyap, R. Collins, and Y. Liu
SBCCI
2003
ACM
135views VLSI» more  SBCCI 2003»
15 years 6 months ago
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Mauricio Ayala-Rincón, Rodrigo B. Nogueira,...
TPHOL
2005
IEEE
15 years 7 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
ISVC
2005
Springer
15 years 7 months ago
Mining Paths of Complex Crowd Scenes
The Ambient Intelligence (AmI) paradigm requires a robust interpretation of people actions and behaviour and a way for automatically generating persistent spatial-temporal models o...
Beibei Zhan, Paolo Remagnino, Sergio A. Velastin