Sciweavers

502 search results - page 35 / 101
» Streaming Random Forests
Sort
View
ICALP
2009
Springer
14 years 10 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 11 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
ICMCS
2005
IEEE
71views Multimedia» more  ICMCS 2005»
14 years 3 months ago
A proposal of butterfly-graph based stream authentication over lossy networks
In this paper, we propose a butterfly-graph based stream authentication scheme for lossy networks where the streaming packets could be lost in both random and burst ways. Due to t...
Zhishou Zhang, Qibin Sun, Wai-Choong Wong
WSC
2008
14 years 8 days ago
Comparing two systems: Beyond common random numbers
Suppose one wishes to compare two closely related systems via stochastic simulation. Common random numbers (CRN) involves using the same streams of uniform random variates as inpu...
Samuel Ehrlichman, Shane G. Henderson
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
14 years 10 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam