4781 search results - page 294 / 957 » Online algorithms for network design |
148
click to vote
TSP
2008
15 years 6 months ago
2008
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
204
click to vote
PPSN
2004
Springer
16 years 3 days ago
2004
Springer
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
218
click to vote
DMTCS
2010
15 years 4 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
196
click to vote
CSCW
2002
ACM
15 years 6 months ago
2002
ACM
Collaborative filtering has proven to be valuable for recommending items in many different domains. In this paper, we explore the use of collaborative filtering to recommend resea...
177
click to vote
IPSN
2004
Springer
16 years 4 days ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...