Sciweavers

4198 search results - page 324 / 840
» In search of lost time
Sort
View
CVPR
2010
IEEE
16 years 3 months ago
A Constant-Space Belief Propagation Algorithm for Stereo Matching
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
Qingxiong Yang, Liang Wang, Narendra Ahuja
CEC
2008
IEEE
16 years 1 months ago
Learning what to ignore: Memetic climbing in topology and weight space
— We present the memetic climber, a simple search algorithm that learns topology and weights of neural networks on different time scales. When applied to the problem of learning ...
Julian Togelius, Faustino J. Gomez, Jürgen Sc...
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
16 years 1 months ago
Latency Analysis of Coalescence for Robot Groups
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
Sameera Poduri, Gaurav S. Sukhatme
GECCO
2007
Springer
140views Optimization» more  GECCO 2007»
16 years 1 months ago
On the moments of the sampling distribution of particle swarm optimisers
A method is presented that allows one to exactly determine all the characteristics of a PSO’s sampling distribution and explain how it changes over time, in the presence stochas...
Riccardo Poli
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
16 years 26 days ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl