58 search results - page 10 / 12 » On Rank vs. Communication Complexity |
KES
2004
Springer
14 years 3 months ago
2004
Springer
Recommendation systems often use association rules as main technique to discover useful links among the set of transactions, especially web usage data – historical user sessions....
PC
2002
13 years 9 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
PODS
2006
ACM
14 years 10 months ago
2006
ACM
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
ICDCS
2009
IEEE
14 years 7 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
CISS
2007
IEEE
14 years 4 months ago
2007
IEEE
— We study the case of a single transmitter, which communicates to two co-located users, through an independent block Rayleigh fading channel. The co-location nature of the users...