Sciweavers

2192 search results - page 92 / 439
» Algorithms for Challenging Motif Problems
Sort
View
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 6 months ago
Implementing Distributed Controllers for Systems with Priorities
is a challenging problem. We consider here abstract specifications consisting of a composition of components and a controller given in the form of a set of interactions and a prior...
Imene Ben Hafaiedh, Susanne Graf, Hammadi Khairall...
WACV
2012
IEEE
12 years 3 months ago
Online discriminative object tracking with local sparse representation
We propose an online algorithm based on local sparse representation for robust object tracking. Local image patches of a target object are represented by their sparse codes with a...
Qing Wang, Feng Chen, Wenli Xu, Ming-Hsuan Yang
CVPR
2012
IEEE
11 years 10 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
13 years 9 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
AGI
2008
13 years 9 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov