Sciweavers

2713 search results - page 44 / 543
» Parameterized Tree Systems
Sort
View
SFP
2001
13 years 11 months ago
Infinite Pretty-printing in eXene
We describe the design and implementation of a Standard ML of New Jersey library for the interactive pretty-printing of possibly infinite syntax trees. The library handles elision ...
Allen Stoughton
LREC
2008
125views Education» more  LREC 2008»
13 years 11 months ago
I saw TREE trees in the park: How to Correct Real-Word Spelling Mistakes
This paper presents a context sensitive spell checking system that uses mixed trigram models, and introduces a new empirically grounded method for building confusion sets. The pro...
Davide Fossati, Barbara Di Eugenio
COCOON
2007
Springer
14 years 4 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
AINA
2008
IEEE
14 years 4 months ago
Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
Min-Feng Wang, Yen-Ching Wu, Meng-Feng Tsai
IPTPS
2005
Springer
14 years 3 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang