477 search results - page 64 / 96 » Algorithms for dynamic geometric problems over data streams |
ML
2002
ACM
13 years 8 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
FITRAMEN
2008
13 years 10 months ago
2008
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
DAGSTUHL
2007
13 years 10 months ago
2007
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
STOC
2012
ACM
11 years 11 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
HPDC
2002
IEEE
14 years 1 months ago
2002
IEEE
One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effe...