Sciweavers

3874 search results - page 100 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
SIGCOMM
2010
ACM
14 years 10 months ago
Stochastic approximation algorithm for optimal throughput performance of wireless LANs
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...
Sundaresan Krishnan, Prasanna Chaporkar
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
15 years 11 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 2 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers

Publication
222views
15 years 6 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
15 years 10 months ago
Sampling-based dimension reduction for subspace approximation
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
Amit Deshpande, Kasturi R. Varadarajan