Sciweavers

303 search results - page 16 / 61
» Incentive analysis of approximately efficient allocation alg...
Sort
View
ICC
2007
IEEE
14 years 1 months ago
Performance Study of Bandwidth Allocation Techniques for QoS-Constrained Satellite Networks
—The paper analyzes the performance of the bandwidth allocation process over satellite communication systems in presence of specific Quality of Service (QoS) requirements. The re...
Igor Bisio, Mario Marchese
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 4 months ago
Selective Call Out and Real Time Bidding
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
DOLAP
2005
ACM
13 years 9 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
13 years 11 months ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...