Sciweavers

6365 search results - page 804 / 1273
» Fast Local Computation Algorithms
Sort
View
ACL
2010
15 years 5 months ago
Blocked Inference in Bayesian Tree Substitution Grammars
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
Trevor Cohn, Phil Blunsom
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
15 years 8 months ago
Non-genetic transmission of memes by diffusion
In recent years, there has been an increase in research activities on Memetic Algorithm (MA). MA works with memes; a meme being defined as “the basic unit of cultural transmiss...
Quang Huy Nguyen 0001, Yew-Soon Ong, Meng-Hiot Lim
PAMI
2006
145views more  PAMI 2006»
15 years 7 months ago
Convergent Tree-Reweighted Message Passing for Energy Minimization
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
Vladimir Kolmogorov
ICIP
2005
IEEE
16 years 9 months ago
Joint feature-spatial-measure space: a new approach to highly efficient probabilistic object tracking
In this paper we present a probabilistic framework for tracking objects based on local dynamic segmentation. We view the segn to be a Markov labeling process and abstract it as a ...
Feng Chen, XiaoTong Yuan, ShuTang Yang
CP
2009
Springer
16 years 2 months ago
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
Serdar Kadioglu, Meinolf Sellmann