Sciweavers

1059 search results - page 49 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
DAS
2008
Springer
14 years 11 months ago
Towards Whole-Book Recognition
We describe experimental results for unsupervised recognition of the textual contents of book-images using fully automatic mutual-entropy-based model adaptation. Each experiment s...
Pingping Xiu, Henry S. Baird
INFOCOM
2009
IEEE
15 years 4 months ago
Coalitional Games for Distributed Collaborative Spectrum Sensing in Cognitive Radio Networks
— Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent tra...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
COMPGEOM
1993
ACM
15 years 1 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
PODC
2006
ACM
15 years 3 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah