Sciweavers

307 search results - page 48 / 62
» The communication complexity of distributed task allocation
Sort
View
89
Voted
ITNG
2008
IEEE
15 years 3 months ago
Parallel FFT Algorithms on Network-on-Chips
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
Jun Ho Bahn, Jungsook Yang, Nader Bagherzadeh
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
15 years 10 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
PDP
2002
IEEE
15 years 2 months ago
The CDAG: A Data Structure for Automatic Parallelization for a Multithreaded Architecture
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
Bernd Klauer, Frank Eschmann, Ronald Moore, Klaus ...
WICON
2008
14 years 11 months ago
Efficient XML usage within wireless sensor networks
Integrating wireless sensor networks in heterogeneous networks is a complex task. A reason is the absence of a standardized data exchange format that is supported in all participa...
Nils Hoeller, Christoph Reinke, Jana Neumann, Sven...
PPSN
1998
Springer
15 years 1 months ago
Comparison of Evolutionary Algorithms for Design Optimization
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
Wilfried Jakob, Martina Gorges-Schleuter, Ingo Sie...