Sciweavers

214 search results - page 32 / 43
» Note on Sparse Random Graphs and Cover Graphs
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke

Book
519views
15 years 6 months ago
Information Theory, Inference, and Learning Algorithms
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and...
David J. C. MacKay
TAMC
2010
Springer
14 years 27 days ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
TMM
2010
249views Management» more  TMM 2010»
13 years 2 months ago
Bridging the Semantic Gap Between Image Contents and Tags
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...
Hao Ma, Jianke Zhu, Michael R. Lyu, Irwin King
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert