Sciweavers

2492 search results - page 32 / 499
» On the General Signature Trees
Sort
View
FCCM
2005
IEEE
102views VLSI» more  FCCM 2005»
14 years 1 months ago
A Signature Match Processor Architecture for Network Intrusion Detection
In this paper, we introduce a novel architecture for a hardware based network intrusion detection system (NIDS). NIDSs are becoming critical components of the network infrastructu...
Janardhan Singaraju, Long Bu, John A. Chandy
CIKM
2009
Springer
14 years 2 months ago
AS-index: a structure for string search using n-grams and algebraic signatures
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
Cédric du Mouza, Witold Litwin, Philippe Ri...

Publication
417views
14 years 4 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
TCIAIG
2010
13 years 2 months ago
Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing
Monte-Carlo tree search has recently been very successful for game playing particularly for games where the evaluation of a state is difficult to compute, such as Go or General Gam...
Jean Méhat, Tristan Cazenave
28
Voted
WIA
2009
Springer
14 years 2 months ago
Random Generation of Deterministic Tree (Walking) Automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...