Sciweavers

23557 search results - page 677 / 4712
» Distributed Computing - Introduction
Sort
View
176
Voted
ISM
2006
IEEE
113views Multimedia» more  ISM 2006»
16 years 1 months ago
Individualization and Flexibility through Computer Algebra Systems in Virtual Laboratories
Virtual labs enable field specific experiments and open them for collaborative and distributed usage. In order to realize comprehensive laboratory set-ups providing a scientifi...
Sabina Jeschke, Thomas Richter
SENSYS
2004
ACM
16 years 27 days 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...
WSNA
2003
ACM
16 years 21 days ago
Computation hierarchy for in-network processing
In this paper we explore the network level architecture of distributed sensor systems that perform in-network processing. We propose a system with heterogeneous nodes that organiz...
Ram Kumar, Vlasios Tsiatsis, Mani B. Srivastava
204
Voted
SSPR
2000
Springer
15 years 11 months ago
Assessing the Computational Effort for Structural 3D Vehicle Recognition
A model based structural recognition approach is used for 3D detection and localization of vehicles. It is theoretically founded by syntactic pattern recognition using coordinate g...
Eckart Michaelsen, Uwe Stilla
JPDC
2006
134views more  JPDC 2006»
15 years 7 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