6575 search results - page 215 / 1315 » Specializing visualization algorithms |
203
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
177
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
170
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
177
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
163
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...