4894 search results - page 301 / 979 » The Guarding Problem - Complexity and Approximation |
306
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
274
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
213
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
164
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
183
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...