Sciweavers

783 search results - page 44 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
ISMIS
2005
Springer
14 years 2 months ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
14 years 2 months ago
Cost-Sharing Mechanisms for Network Design
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
Anupam Gupta, Aravind Srinivasan, Éva Tardo...
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
12 years 11 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
14 years 9 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 3 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing