Sciweavers

6939 search results - page 490 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
SPAA
2009
ACM
15 years 11 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
TCS
2011
14 years 11 months ago
An algorithmic framework for network reconstruction
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the re...
Markus Durzinsky, Annegret Wagler, Robert Weismant...
139
Voted
VLDB
2004
ACM
127views Database» more  VLDB 2004»
15 years 10 months ago
Computing Frequent Itemsets Inside Oracle 10G
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
Wei Li, Ari Mozes
164
Voted
ICPP
1993
IEEE
15 years 9 months ago
Scalability Study of the KSR-1
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...
Umakishore Ramachandran, Gautam Shah, Ravi Kumar, ...
DAC
2007
ACM
16 years 5 months ago
Implicitly Parallel Programming Models for Thousand-Core Microprocessors
This paper argues for an implicitly parallel programming model for many-core microprocessors, and provides initial technical approaches towards this goal. In an implicitly paralle...
Wen-mei W. Hwu, Shane Ryoo, Sain-Zee Ueng, John H....