Sciweavers

1806 search results - page 193 / 362
» Randomness and halting probabilities
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
SEMWEB
2007
Springer
16 years 21 days ago
Sampling and Soundness: Can We Have Both?
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
P2P
2006
IEEE
153views Communications» more  P2P 2006»
16 years 18 days ago
Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment,...
Anwitaman Datta, Karl Aberer
CIKM
2008
Springer
15 years 8 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 6 months ago
An Energy-Based Comparison of Long-Hop and Short-Hop Routing in MIMO Networks
This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each trans...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...