4009 search results - page 468 / 802 » Clustering on Complex Graphs |
185
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
190
click to vote
CRYPTO
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
179
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
309
Voted
Book
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and...
184
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we propose to leverage social graphs from Online Social Networks (OSN) to improve the forwarding efficiency of mobile networks, more particularly Delay Tolerant ...