Sciweavers

492 search results - page 17 / 99
» Fast data stream algorithms using associative memories
Sort
View
IMC
2005
ACM
14 years 1 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang
HPDC
2005
IEEE
14 years 1 months ago
Adaptive data block scheduling for parallel TCP streams
Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. W...
Thomas J. Hacker, Brian D. Noble, Brian D. Athey
SAC
2004
ACM
14 years 1 months ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha
ICTAI
2008
IEEE
14 years 2 months ago
An Incremental Hough Transform for Detecting Ellipses in Image Data Streams
In this paper, we present a purely incremental, scalable algorithm for the detection of elliptical shapes in images. Our method uses an incremental version of the Random Hough Tra...
Sofiane Sellah, Olfa Nasraoui
JSAC
2006
163views more  JSAC 2006»
13 years 7 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood