Sciweavers

14078 search results - page 102 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
SENSYS
2004
ACM
15 years 11 months ago
Power - time optimal algorithm for computing FFT over sensor networks
bstract: Power - Time Optimal Algorithm for Computing FFT over Sensor Networks Categories and Subject Descriptors C.2.1 [Network Architecture and Design] Wireless Communication, Di...
Turkmen Canli, Mark Terwilliger, Ajay K. Gupta, As...
156
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
DATE
2004
IEEE
134views Hardware» more  DATE 2004»
15 years 10 months ago
Context-Aware Performance Analysis for Efficient Embedded System Design
Performance analysis has many advantages in theory compared to simulation for the validation of complex embedded systems, but is rarely used in practice. To make analysis more att...
Marek Jersak, Rafik Henia, Rolf Ernst
ICMCS
2006
IEEE
194views Multimedia» more  ICMCS 2006»
16 years 5 days ago
An Architecture Design of Threshold-Based Best-Basis Algorithm
The best-basis algorithm has gained much importance on textured-based image compression and denoising of signals. In this paper, an architecture for the wavelet-packet based best-...
S. Mayilavelane Aroutchelvame, Kaamran Raahemifar