724 search results - page 99 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
116
click to vote
APCSAC
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
115
click to vote
COMPGEOM
2001
ACM
15 years 6 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
125
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
152
click to vote
FDTC
2010
Springer
15 years 1 months ago
2010
Springer
Many implementations of cryptographic algorithms have shown to be susceptible to fault attacks. For some of them, countermeasures against specific fault models have been proposed. ...
128
click to vote
RECOMB
2008
Springer
16 years 3 months ago
2008
Springer
We introduce the first exact and efficient algorithm for Guig?o et al.'s problem that, given a collection of rooted, binary gene trees and a rooted, binary species tree, deter...