Sciweavers

2705 search results - page 385 / 541
» Splitting the sensor node
Sort
View
DCOSS
2011
Springer
14 years 3 months ago
Distributed local broadcasting algorithms in the physical interference model
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 1 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
CCGRID
2007
IEEE
15 years 10 months ago
High-Performance MPI Broadcast Algorithm for Grid Environments Utilizing Multi-lane NICs
The performance of MPI collective operations, such as broadcast and reduction, is heavily affected by network topologies, especially in grid environments. Many techniques to cons...
Tatsuhiro Chiba, Toshio Endo, Satoshi Matsuoka
AXMEDIS
2006
IEEE
215views Multimedia» more  AXMEDIS 2006»
15 years 10 months ago
Distributed Architectures for High Performance and Privacy-Aware Content Generation and Delivery
The increasing heterogeneity of mobile client devices used to access the Web requires run-time adaptations of the Web contents. A significant trend in these content adaptation se...
Claudia Canali, Michele Colajanni, Riccardo Lancel...
128
Voted
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 7 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....