4843 search results - page 293 / 969 » The Shortcut Problem - Complexity and Approximation |
209
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...
161
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...
181
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...
169
click to vote
ICC
2007
IEEE
16 years 28 days ago
2007
IEEE
— Approximating the sum of Log–Normal random variables (RVs) is a long–standing open issue, in the old and recent literature, and many approaches have been proposed to deal w...
161
click to vote
ICALP
2007
Springer
16 years 23 days ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...