15485 search results - page 2581 / 3097 » Computing Optimal Subsets |
184
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
209
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
216
click to vote
HPDC
2006
IEEE
16 years 1 months ago
2006
IEEE
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
218
click to vote
ICPP
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
183
click to vote
IPCCC
2006
IEEE
16 years 1 months ago
2006
IEEE
In recent years, malicious software (malware) has become one of the most insidious threats in computer security. However, this is arguably not the result of increased sophisticati...