4451 search results - page 612 / 891 » On Random Ordering Constraints |
152
click to vote
INFOCOM
2006
IEEE
16 years 19 days ago
2006
IEEE
— Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of ...
191
click to vote
INFOSCALE
2006
ACM
16 years 17 days ago
2006
ACM
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
172
Voted
SAC
2006
ACM
16 years 17 days ago
2006
ACM
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
163
click to vote
WEA
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
170
click to vote
ICA
2004
Springer
16 years 4 hour ago
2004
Springer
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...