Sciweavers

1137 search results - page 109 / 228
» The GLOBAL optimization method revisited
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 9 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
MM
2010
ACM
186views Multimedia» more  MM 2010»
13 years 9 months ago
Hybrid load balancing for online games
As massively multiplayer online games are becoming very popular, how to support a large number of concurrent users while maintaining the game performance has become an important r...
Rynson W. H. Lau
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
13 years 10 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
ICC
2011
IEEE
239views Communications» more  ICC 2011»
12 years 8 months ago
The Insights of DV-Based Localization Algorithms in the Wireless Sensor Networks with Duty-Cycled and Radio Irregular Sensors
—Location information of nodes is the basis for many applications in wireless sensor networks (WSNs). However, most previous localization methods make the unrealistic assumption:...
Yuanfang Chen, Lei Shu, Mingchu Li, Ziqi Fan, Lei ...
CVPR
2006
IEEE
14 years 3 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