6251 search results - page 388 / 1251 » Randomness, Computability, and Density |
193
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
154
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we introduce a new scheme called SecureRank for prioritizing vulnerabilities to patch in computing systems/networks. This has become a key issue for IT infrastru...
185
click to vote
WEBI
2005
Springer
16 years 7 days ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
174
click to vote
APGV
2004
ACM
16 years 6 days ago
2004
ACM
The class of all natural images is an extremely small fraction of all possible images. Some of the structure of natural images can be modeled statistically, revealing striking reg...
194
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...