Sciweavers

1511 search results - page 101 / 303
» On the effectiveness of address-space randomization
Sort
View
VLDB
2005
ACM
132views Database» more  VLDB 2005»
14 years 8 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
ICASSP
2008
IEEE
14 years 2 months ago
Finding needles in noisy haystacks
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...
SAINT
2007
IEEE
14 years 2 months ago
SPRED: Active Queue Management Mechanism for Wide-Area Networks
AQM (Active Queue Management) mechanism is a congestion control mechanism at a router for controlling the number of packets in the router’s buffer by actively discarding an arri...
Hiroyuki Ohsaki, Hideyuki Yamamoto, Makoto Imase
CIBCB
2006
IEEE
14 years 2 months ago
A Stochastic model to estimate the time taken for Protein-Ligand Docking
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 1 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold