4985 search results - page 121 / 997 » Re-Configurable Computing in Wireless |
123
Voted
CCCG
2008
15 years 5 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
125
click to vote
PERCOM
2005
ACM
16 years 3 months ago
2005
ACM
Distribution of media in the fast growing world of digital stored content and multimedia supporting devices with connectivity, calls for a new media distribution architecture. The...
106
click to vote
PERCOM
2005
ACM
16 years 3 months ago
2005
ACM
Privacy is widely recognised as a significant obstacle inhibiting the adoption of context-aware applications. In order to remove this obstacle, advances are required in many areas...
163
click to vote
SENSYS
2004
ACM
15 years 9 months ago
2004
ACM
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...
116
Voted
JPDC
2006
15 years 3 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...