Sciweavers

2157 search results - page 249 / 432
» Binary ant algorithm
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Online Multiclass LPBoost
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...
Amir Saffari, Martin Godec, Thomas Pock, Christian...
194
Voted
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
16 years 1 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
ICASSP
2009
IEEE
16 years 1 months ago
Design of a morphological moving object signature and application to human identification
Many computer vision systems try to infer semantic information about a video scene content by looking at the time series of the silhouettes of the moving objects. This paper propo...
Olivier Barnich, Marc Van Droogenbroeck
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
16 years 27 days ago
Evolutionary optimization of multistage interconnection networks performance
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
Jirí Jaros
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
16 years 27 days ago
Hilbert's Thirteenth Problem and Circuit Complexity
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...