1137 search results - page 109 / 228 » The GLOBAL optimization method revisited |
135
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
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 ...
117
Voted
MM
2010
ACM
15 years 3 months ago
2010
ACM
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...
133
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
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...
163
Voted
ICC
2011
IEEE
14 years 3 months ago
2011
IEEE
—Location information of nodes is the basis for many applications in wireless sensor networks (WSNs). However, most previous localization methods make the unrealistic assumption:...
117
Voted
CVPR
2006
IEEE
15 years 9 months ago
2006
IEEE
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...