Sciweavers

Share
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
9 years 17 days ago
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, St&e...
ICASSP
2010
IEEE
9 years 1 months ago
An alternative scanning strategy to detect faces
The sliding window approach is the most widely used technique to detect faces in an image. Usually a classifier is applied on a regular grid and to speed up the scanning, the gri...
Venkatesh Bala Subburaman, Sébastien Marcel
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
9 years 2 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
ALGORITHMICA
2004
84views more  ALGORITHMICA 2004»
9 years 2 months ago
Computing Diameter in the Streaming and Sliding-Window Models
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004
TKDE
2008
155views more  TKDE 2008»
9 years 2 months ago
Incremental Maintenance of Online Summaries Over Multiple Streams
We propose a novel approach based on predictive quantization (PQ) for online summarization of multiple time-varying data streams. A synopsis over a sliding window of most recent en...
Fatih Altiparmak, Ertem Tuncel, Hakan Ferhatosmano...
JIIS
2008
133views more  JIIS 2008»
9 years 2 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng
COMCOM
2006
88views more  COMCOM 2006»
9 years 2 months ago
Using attack graphs for correlating, hypothesizing, and predicting intrusion alerts
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
Lingyu Wang, Anyi Liu, Sushil Jajodia
CORR
2008
Springer
157views Education» more  CORR 2008»
9 years 2 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
RSS
2007
192views Robotics» more  RSS 2007»
9 years 4 months ago
Simultaneous Localisation and Mapping in Dynamic Environments (SLAMIDE) with Reversible Data Associa
Abstract— The conventional technique for dealing with dynamic objects in SLAM is to detect them and then either treat them as outliers [20][1] or track them separately using trad...
Charles Bibby, Ian D. Reid
DAWAK
2006
Springer
9 years 6 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin
books