Sciweavers

854 search results - page 32 / 171
» Abstracting from Failure Probabilities
Sort
View
GLOBECOM
2007
IEEE
15 years 8 months ago
On the Expected Connection Lifetime and Stochastic Resilience of Wireless Multi-Hop Networks
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
Fei Xing, Wenye Wang
TOIS
2010
128views more  TOIS 2010»
15 years 8 days ago
Learning author-topic models from text corpora
We propose a new unsupervised learning technique for extracting information about authors and topics from large text collections. We model documents as if they were generated by a...
Michal Rosen-Zvi, Chaitanya Chemudugunta, Thomas L...
PPOPP
2005
ACM
15 years 7 months ago
Fault tolerant high performance computing by a coding approach
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
Zizhong Chen, Graham E. Fagg, Edgar Gabriel, Julie...
ECIR
2009
Springer
15 years 11 months ago
A Probabilistic Retrieval Model for Semistructured Data
Abstract. Retrieving semistructured (XML) data typically requires either a structured query such as XPath, or a keyword query that does not take structure into account. In this pap...
Jinyoung Kim, Xiaobing Xue, W. Bruce Croft
FSE
2008
Springer
117views Cryptology» more  FSE 2008»
15 years 3 months ago
Efficient Reconstruction of RC4 Keys from Internal States
Abstract. In this paper we present an efficient algorithm for the retrieval of the RC4 secret key, given an internal state. This algorithm is several orders of magnitude faster tha...
Eli Biham, Yaniv Carmeli