Sciweavers

659 search results - page 70 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Graph Based Discriminative Learning for Robust and Efficient Object Tracking
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
Xiaoqin Zhang, Weiming Hu, Stephen J. Maybank, Xi ...
ISPDC
2005
IEEE
14 years 1 months ago
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
ISPA
2007
Springer
14 years 1 months ago
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
Thara Angskun, George Bosilca, Jack Dongarra
CVPR
2006
IEEE
14 years 1 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
13 years 8 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur