6251 search results - page 325 / 1251 » Randomness, Computability, and Density |
222
click to vote
ICDM
2006
IEEE
16 years 22 days 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...
168
click to vote
P2P
2005
IEEE
16 years 8 days ago
2005
IEEE
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
190
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
170
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper looks at the nonparametric, multiscale, Markov Random Field (MRF) model and its application in classifying the MeasTex Test Suite. The MeasTex Test Suite is a standard ...
150
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...