Sciweavers

492 search results - page 39 / 99
» Fast data stream algorithms using associative memories
Sort
View
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
13 years 5 months 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...
ANCS
2007
ACM
13 years 11 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
AVI
2004
13 years 9 months ago
CircleView: a new approach for visualizing time-related multidimensional data sets
This paper introduces a new approach for visualizing multidimensional time-referenced data sets, called Circle View. The Circle View technique is a combination of hierarchical vis...
Daniel A. Keim, Jörn Schneidewind, Mike Sips
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 8 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
JCPHY
2011
192views more  JCPHY 2011»
12 years 10 months ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer