686 search results - page 15 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
SIGMETRICS
2006
ACM
15 years 5 months ago
2006
ACM
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are inte...
WWW
2004
ACM
16 years 11 days ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
136
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...