2713 search results - page 44 / 543 » Parameterized Tree Systems |
159
click to vote
SFP
2001
15 years 7 months ago
2001
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 ...
147
click to vote
LREC
2008
15 years 7 months ago
2008
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...
138
click to vote
COCOON
2007
Springer
16 years 3 days ago
2007
Springer
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...
160
click to vote
AINA
2008
IEEE
16 years 12 days ago
2008
IEEE
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,...
156
click to vote
IPTPS
2005
Springer
15 years 11 months ago
2005
Springer
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...