5595 search results - page 161 / 1119 » Approximation Algorithms for Clustering Problems |
138
click to vote
SIGCOMM
2010
ACM
15 years 5 months ago
2010
ACM
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 ...
143
Voted
GD
2005
Springer
15 years 10 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
265
click to vote
ICDE
2002
IEEE
16 years 6 months ago
2002
IEEE
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,...
198
Voted
CPM
1998
Springer
15 years 9 months ago
1998
Springer
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...
168
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...