Sciweavers

69 search results - page 2 / 14
» Constant-factor approximation algorithms for identifying dyn...
Sort
View
TON
2010
127views more  TON 2010»
12 years 11 months ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi
DATAMINE
2010
189views more  DATAMINE 2010»
13 years 4 months ago
A game-theoretic framework to identify overlapping communities in social networks
In this paper, we introduce a game-theoretic framework to address the community detection problem based on the structures of social networks. We formulate the dynamics of community...
Wei Chen, Zhenming Liu, Xiaorui Sun, Yajun Wang
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan
ATAL
2010
Springer
13 years 6 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 5 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...