Sciweavers

866 search results - page 12 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
VTC
2010
IEEE
163views Communications» more  VTC 2010»
14 years 10 months ago
Channel Allocation in a Multiple Distributed Vehicular Users Using Game Theory
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
Yusita Kasdani, Yong Huat Chew, Chau Yuen, Woon Ha...
INFOCOM
2008
IEEE
15 years 6 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
FLAIRS
2006
15 years 1 months ago
Coalition Formation Meets Information Theory
The process of coalition formation, where distinct autonomous agents come together to act as a coherent group is an important form of interaction in multiagent systems. Previous w...
Victor Palmer, Thomas R. Ioerger
SPAA
2004
ACM
15 years 5 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 3 days ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth