Sciweavers

1381 search results - page 68 / 277
» Structural signatures for tree data structures
Sort
View
GLOBECOM
2008
IEEE
14 years 10 months ago
Highly Memory-Efficient LogLog Hash for Deep Packet Inspection
As the network line rates reach 40 Gbps today and 100 Gbps in the near future, performing deep packet inspection (DPI) in the Network Intrusion Detection and Prevention Systems (NI...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
ICML
2006
IEEE
15 years 6 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
HPCC
2010
Springer
14 years 11 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
15 years 2 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
IDEAS
2000
IEEE
108views Database» more  IDEAS 2000»
15 years 2 months ago
Plug and Play with Query Algebras: SECONDO-A Generic DBMS Development Environment
We present SECONDO, a new generic environment supporting the implementation of database systems for a wide range of data models and query languages. On the one hand, this framewor...
Stefan Dieker, Ralf Hartmut Güting