Sciweavers

2233 search results - page 258 / 447
» On the Complexity of Theory Curbing
Sort
View
DCC
2005
IEEE
16 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
SAC
2010
ACM
16 years 1 months ago
Estimating node similarity from co-citation in a spatial graph model
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
Jeannette Janssen, Pawel Pralat, Rory Wilson
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
16 years 1 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
CSE
2009
IEEE
16 years 1 months ago
The Importance of Data Collection for Modelling Contact Networks
—The recently developed small wireless devices ranging from sensor boards to mobile phones provide a timely opportunity to gather unique data sets on complex human interactions, ...
Eiko Yoneki
ATAL
2009
Springer
16 years 1 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge