Sciweavers

336 search results - page 65 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
NIPS
2004
13 years 8 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
MOBIHOC
2005
ACM
14 years 7 months ago
A secure ad-hoc routing approach using localized self-healing communities
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
Jiejun Kong, Xiaoyan Hong, Yunjung Yi, Joon-Sang P...
ACMSE
2004
ACM
14 years 27 days ago
Performance evaluation of cache replacement policies for the SPEC CPU2000 benchmark suite
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....
Hussein Al-Zoubi, Aleksandar Milenkovic, Milena Mi...
CIBCB
2006
IEEE
13 years 11 months ago
Efficient Probe Selection in Microarray Design
Abstract-- The DNA microarray technology, originally developed to measure the level of gene expression, had become one of the most widely used tools in genomic study. Microarrays h...
Leszek Gasieniec, Cindy Y. Li, Paul Sant, Prudence...
NSDI
2008
13 years 9 months ago
Phalanx: Withstanding Multimillion-Node Botnets
Large-scale distributed denial of service (DoS) attacks are an unfortunate everyday reality on the Internet. They are simple to execute and with the growing prevalence and size of...
Colin Dixon, Thomas E. Anderson, Arvind Krishnamur...