1951 search results - page 286 / 391 » An algorithm for improving graph partitions |
153
click to vote
CVPR
2008
IEEE
16 years 6 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 ...
149
click to vote
HEURISTICS
2006
15 years 4 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 ...
138
click to vote
ICTIR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. It is well known that pseudo-relevance feedback (PRF) improves the retrieval performance of Information Retrieval (IR) systems in general. However, a recent study by Cao ...
140
click to vote
KDD
2010
ACM
15 years 6 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...
170
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...