Sciweavers

2735 search results - page 55 / 547
» Comparing notions of randomness
Sort
View
COLT
2003
Springer
14 years 2 months ago
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
John Case, Sanjay Jain, Franco Montagna, Giulia Si...
CN
1999
73views more  CN 1999»
13 years 8 months ago
Measuring Index Quality Using Random Walks on the Web
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
JCT
2002
56views more  JCT 2002»
13 years 8 months ago
The Width of Random Subsets of Boolean Lattices
Suppose we toss an independent coin with probability of success p for each subset of [n] = {1, . . . , n}, and form the random hypergraph P(n, p) by taking as hyperedges the subse...
Yoshiharu Kohayakawa, Bernd Kreuter
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
14 years 3 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
14 years 9 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini