502 search results - page 83 / 101 » Streaming Random Forests |
SAC
1998
ACM
14 years 2 months ago
1998
ACM
In a Video-on-Demand server, requests from different clients are independent of each other and may arrive at random time. Commercial systems may contain hundreds to thousands of c...
BROADCOM
2008
IEEE
13 years 12 months ago
2008
IEEE
In this paper we propose and analyze an efficient flooding technique for static multi-hop wireless networks. The protocol builds up a routing tree that connects all network nodes....
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
SODA
2012
ACM
12 years 8 days ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
ICIP
2007
IEEE
14 years 11 months ago
2007
IEEE
The emergence of 3G and 4G wireless networks brings with it the possibility of streaming high quality video content on-demand to mobile users. Wireless video applications require ...