Sciweavers

197 search results - page 30 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
MOBICOM
2009
ACM
14 years 1 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
SPAA
2004
ACM
14 years 23 days ago
The effect of faults on network expansion
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary...
GLVLSI
2009
IEEE
126views VLSI» more  GLVLSI 2009»
13 years 11 months ago
An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
Taiga Takata, Yusuke Matsunaga
DMSN
2007
ACM
13 years 11 months ago
Similarity-aware query allocation in sensor networks with multiple base stations
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be ...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan...
CN
2007
116views more  CN 2007»
13 years 7 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer