Sciweavers

866 search results - page 98 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
QSHINE
2009
IEEE
16 years 1 months ago
Credit-Token Based Inter-cell Radio Resource Management: A Game Theoretic Approach
Abstract. In this paper, a radio resource sharing scheme for wireless cellular network is investigated to achieve efficiency and fairness among base stations. We propose a credit-t...
Chun-Han Ko, Hung-Yu Wei
KER
2008
193views more  KER 2008»
15 years 6 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
CIKM
2009
Springer
16 years 28 days ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun
ATAL
2005
Springer
15 years 12 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...