1399 search results - page 6 / 280 » New Algorithms for k-Center and Extensions |
114
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm (GDL) [1] to efficiently solve...
133
click to vote
CCCG
2010
15 years 6 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
144
click to vote
AFRICACRYPT
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
141
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
Active machine learning algorithms are used when large numbers of unlabeled examples are available and getting labels for them is costly (e.g. requiring consulting a human expert)...
101
click to vote
PADS
2005
ACM
15 years 10 months ago
2005
ACM
In this paper we introduce a new concept, network atomic operations (NAOs) to create a zero-cost consistent cut. Using NAOs, we define a wall-clock-time driven GVT algorithm call...