Sciweavers

492 search results - page 4 / 99
» Fast data stream algorithms using associative memories
Sort
View
ANCS
2006
ACM
14 years 1 months ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
14 years 25 days ago
Simultaneous localization and mapping with unknown data association using fastSLAM
— The Extended Kalman Filter (EKF) has been the de facto approach to the Simultaneous Localization and Mapping (SLAM) problem for nearly fifteen years. However, the EKF has two ...
Michael Montemerlo, Sebastian Thrun
PODS
2002
ACM
164views Database» more  PODS 2002»
14 years 7 months ago
Characterizing Memory Requirements for Queries over Continuous Data Streams
We consider conjunctive queries with arithmetic comparisons over multiple continuous data streams. We specify an algorithm for determining whether or not a query can be evaluated ...
Arvind Arasu, Brian Babcock, Shivnath Babu, Jon Mc...
FOCS
2000
IEEE
13 years 12 months ago
Clustering Data Streams
The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, web documents and clickstreams. For analysis o...
Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan ...
CLUSTER
2009
IEEE
13 years 11 months ago
Using a cluster as a memory resource: A fast and large virtual memory on MPI
—The 64-bit OS provides ample memory address space that is beneficial for applications using a large amount of data. This paper proposes using a cluster as a memory resource for...
Hiroko Midorikawa, Kazuhiro Saito, Mitsuhisa Sato,...