25167 search results - page 118 / 5034 » Parallel and Distributed Algorithms |
117
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
77
Voted
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
134
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
123
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
124
Voted
ICPP
2009
IEEE
15 years 9 months ago
2009
IEEE
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...