Sciweavers

66 search results - page 6 / 14
» Spatio-temporal data reduction with deterministic error boun...
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
15 years 9 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
NAACL
2007
14 years 11 months ago
Incremental Non-Projective Dependency Parsing
An open issue in data-driven dependency parsing is how to handle non-projective dependencies, which seem to be required by linguistically adequate representations, but which pose ...
Joakim Nivre
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
15 years 3 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010
PVLDB
2010
134views more  PVLDB 2010»
14 years 8 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
JMLR
2010
101views more  JMLR 2010»
14 years 4 months ago
Efficient Reductions for Imitation Learning
Imitation Learning, while applied successfully on many large real-world problems, is typically addressed as a standard supervised learning problem, where it is assumed the trainin...
Stéphane Ross, Drew Bagnell