Sciweavers

486 search results - page 36 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
AAAI
2010
13 years 9 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
ICPPW
2002
IEEE
14 years 20 days ago
A Statistical Approach for the Analysis of the Relation Between Low-Level Performance Information, the Code, and the Environment
This paper presents a methodology for aiding a scientific programmer to evaluate the performance of parallel programs on advanced architectures. It applies well-defined design o...
Nayda G. Santiago, Diane T. Rover, Domingo Rodr&ia...
FSKD
2008
Springer
123views Fuzzy Logic» more  FSKD 2008»
13 years 8 months ago
PartSpan: Parallel Sequence Mining of Trajectory Patterns
The trajectory pattern mining problem has recently attracted increasing attention. This paper precisely addresses the parallel mining problem of trajectory patterns as well as the...
Shaojie Qiao, Changjie Tang, Shucheng Dai, Mingfan...
JPDC
2010
137views more  JPDC 2010»
13 years 6 months ago
Parallel exact inference on the Cell Broadband Engine processor
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
Yinglong Xia, Viktor K. Prasanna
ICPP
2005
IEEE
14 years 1 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal