Sciweavers

2944 search results - page 233 / 589
» On Indexed Data Broadcast
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
16 years 27 days ago
Opportunistic Scheduling for Wireless Network Coding
— This paper addresses a scheduling problem for wireless network coding which has been recently proposed as a novel method to enhance the throughput in wireless networks. The wir...
Hiroyuki Yomo, Petar Popovski
EUROPAR
2007
Springer
16 years 23 days ago
Decision Trees and MPI Collective Algorithm Selection Problem
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
DFMA
2005
IEEE
100views Multimedia» more  DFMA 2005»
16 years 6 days ago
Mobile Computing to Facilitate Interaction in Lectures and Meetings
The Campus Mobile project explored how PDAs and innovative interfaces can improve interaction during lectures and in small meetings. These mobile computers (small PCs or PDAs) are...
Isabelle M. Demeure, Claudie Faure, Eric Lecolinet...
CF
2007
ACM
15 years 10 months ago
Speculative supplier identification for reducing power of interconnects in snoopy cache coherence protocols
In this work we reduce interconnect power dissipation in Symmetric Multiprocessors or SMPs. We revisit snoopy cache coherence protocols and reduce unnecessary interconnect activit...
Ehsan Atoofian, Amirali Baniasadi, Kaveh Aasaraai
TON
2002
175views more  TON 2002»
15 years 6 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher