760 search results - page 106 / 152 » Algorithms for finding clique-transversals of graphs |
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
HEURISTICS
2006
13 years 8 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...