1594 search results - page 217 / 319 » An Algorithm to Compute Collusion Paths |
119
Voted
PPOPP
2005
ACM
15 years 9 months ago
2005
ACM
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
134
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. The current generation of data mining tools have limited capacity and performance, since these tools tend to be sequential. This paper explores a migration path out of th...
107
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
119
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
An effort to formalize the process of software pipelining loops with conditions is presented in this paper. A formal framework for scheduling such loops, based on representing set...
103
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...