7015 search results - page 213 / 1403 » Approximation algorithms for co-clustering |
153
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
186
click to vote
WG
2007
Springer
16 years 18 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
151
click to vote
NIPS
2007
15 years 8 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
184
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper presents a critical analysis of the Pareto-Following Variation Operator (PFVO) when used as an approximation method for Multiobjective Evolutionary Algorithms (MOEA)...
151
click to vote
TAMC
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...