Sciweavers

6110 search results - page 1165 / 1222
» Approximate Computing
Sort
View
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 9 days ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
15 years 9 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
ICALP
2003
Springer
15 years 8 months ago
Algorithmic Aspects of Bandwidth Trading
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph ...
JC
2011
87views more  JC 2011»
14 years 10 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 8 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
« Prev « First page 1165 / 1222 Last » Next »