Sciweavers

502 search results - page 52 / 101
» Streaming Random Forests
Sort
View
ICIP
2007
IEEE
14 years 11 months ago
Encoding Parameter Estimation for RDTC Optimized Compression and Streaming of Image-Based Scene Representations
Remote navigation in image-based scene representations requires random access to parts of the compressed reference image data to compose virtual views. The degree of dependencies ...
Ingo Bauermann, Eckehard G. Steinbach
ICDE
2007
IEEE
143views Database» more  ICDE 2007»
14 years 11 months ago
Hiding in the Crowd: Privacy Preservation on Evolving Streams through Correlation Tracking
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on ra...
Feifei Li, Jimeng Sun, Spiros Papadimitriou, Georg...
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 4 months ago
Load Shedding for Window Joins on Multiple Data Streams
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
Yan-Nei Law, Carlo Zaniolo
VLDB
2004
ACM
134views Database» more  VLDB 2004»
14 years 3 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel