Results 1  10
of
173
Zeros of Riemann's Zeta function are uniformly distributed, but not random: An answer to Calude's open problem
 EATCS Bull
"... It is known that the imaginary parts of the roots of the Riemann's function are uniformly distributed. This fact led Calude to a natural question: is the corresponding sequence (of binary expansions merged together) random in the sense of MartinLof? Our answer is negative: this sequence is not ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is known that the imaginary parts of the roots of the Riemann's function are uniformly distributed. This fact led Calude to a natural question: is the corresponding sequence (of binary expansions merged together) random in the sense of MartinLof? Our answer is negative: this sequence
Random Matrices and the Riemann ZetaFunction: a Review
, 2003
"... The past few years have seen the emergence of compelling evidence for a connection between the zeros of the Riemann zeta function and the eigenvalues of random matrices. This hints at a link between the distribution of the prime numbers, which is governed by the Riemann zeros, and the properties of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
and its kin, and have stimulated new avenues of research in random matrix theory. In particular, it would appear that several longstanding questions concerning the distribution of values taken by the zeta function on the line where the Riemann Hypothesis places its zeros can be answered using techniques
Anonymous Hierarchical IdentityBased Encryption (Without Random Oracles). In: Dwork
 CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identitybased cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract

Cited by 119 (10 self)
 Add to MetaCart
, as was first observed by Boneh et al. [10] and later formalized by Abdalla et al. Prior to this paper, the only IBE system known to be inherently anonymous was that of Boneh and Franklin Our Results We present an Anonymous IBE and HIBE scheme without random oracles, therby solving both open problems from
0 QUANTITATIVE UNIFORM IN TIME CHAOS PROPAGATION FOR BOLTZMANN COLLISION PROCESSES
, 2010
"... ar ..."
likelihood and the role of models in molecular phylogenetics.
 Mol. Biol. Evol.
, 2000
"... Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between the ..."
Abstract

Cited by 70 (11 self)
 Add to MetaCart
) whenever the prior distribution on binary trees is uniform (i.e., when all binary trees are equally likely). Consequently, assuming that the prior distribution assigns equal probabilities to all binary trees, MIL maximizes one's average chance of recovering the correct tree. However
Measuring Index Quality using Random Walks on the Web
 In Proceedings of the Eighth International World Wide Web Conference
, 1999
"... Recent research has studied how to measure the size of a search engine, in terms of the number of pages indexed. In this paper, we consider a different measure for search engines, namely the quality of the pages in a search engine index. We provide a simple, effective algorithm for approximating t ..."
Abstract
 Add to MetaCart
the quality of an index by performing a random walk on the Web, and we use this methodology to compare the index quality of several major search engines.
QuasiMonte Carlo sampling for stochastic variational problems
"... • Computational methods for solving stochastic variational problems require (first) a discretization of the underlying probability distribution induced by a numerical integration scheme for the approximate computation of expectations and (second) an efficient solver for a (large scale) finitedimen ..."
Abstract
 Add to MetaCart
• Computational methods for solving stochastic variational problems require (first) a discretization of the underlying probability distribution induced by a numerical integration scheme for the approximate computation of expectations and (second) an efficient solver for a (large scale) finitedimensional
Transactions on Parallel and Distributed Systems
"... (MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to overprovision for each game tens of selfown ..."
Abstract
 Add to MetaCart
(MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to overprovision for each game tens of selfowned data centres, making the market entry affordable only for big companies. Focusing on the reduction of entry and operational costs, we investigate a new dynamic resource provisioning method for MMOG operation using external data centres as lowcost resource providers. First, we identify in the various types of player interaction a source of shortterm load variability, which complements the longterm load variability due to the size of the player population. Then, we introduce a combined MMOG processor, network, and memory load model that takes into account both the player interaction type and the population
Results 1  10
of
173