Sciweavers

1629 search results - page 203 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
WWW
2007
ACM
15 years 10 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
MOBIHOC
2005
ACM
15 years 9 months ago
Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
Xiangying Yang, Gustavo de Veciana
PDPTA
2000
14 years 11 months ago
Parallel Evolutionary Multi-Criterion Optimization for Block Layout Problems
In this paper, a parallel evolutionary multi-criteria optimization algorithm: DGA and DRMOGA are applied to block layout problems. The results are compared to the results of SGA an...
Shinya Watanabe, Tomoyuki Hiroyasu, Mitsunori Miki
DSN
2011
IEEE
13 years 9 months ago
Cross-layer resilience using wearout aware design flow
—As process technology shrinks devices, circuits experience accelerated wearout. Monitoring wearout will be critical for improving the efficiency of error detection and correctio...
Bardia Zandian, Murali Annavaram
AAAI
1996
14 years 11 months ago
Goal Oriented Symbolic Propagation in Bayesian Networks
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
Enrique Castillo, José Manuel Gutiér...