Sciweavers

158 search results - page 10 / 32
» Simple Fast Parallel Hashing
Sort
View
ICICS
2005
Springer
14 years 1 months ago
PCAV: Internet Attack Visualization on Parallel Coordinates
This paper presents PCAV (Parallel Coordinates Attack Visualizer), a real-time visualization system for detecting large-scale Internet attacks including Internet worms, DDoS attack...
Hyunsang Choi, Heejo Lee
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
13 years 11 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
IPPS
2007
IEEE
14 years 1 months ago
GridCopy: Moving Data Fast on the Grid
An important type of communication in grid and distributed computing environments is bulk data transfer. GridFTP has emerged as a de facto standard for secure, reliable, high-perf...
Rajkumar Kettimuthu, William E. Allcock, Lee Limin...
BMCBI
2010
153views more  BMCBI 2010»
13 years 7 months ago
Pash 3.0: A versatile software package for read mapping and integrative analysis of genomic and epigenomic variation using massi
Background: Massively parallel sequencing readouts of epigenomic assays are enabling integrative genome-wide analyses of genomic and epigenomic variation. Pash 3.0 performs sequen...
Cristian Coarfa, Fuli Yu, Christopher A. Miller, Z...
INFOCOM
2012
IEEE
11 years 10 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy