Sciweavers

254 search results - page 43 / 51
» Restarting Tree Automata
Sort
View
ACL
2010
13 years 6 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
TJS
2010
182views more  TJS 2010»
13 years 7 months ago
A novel unsupervised classification approach for network anomaly detection by k-Means clustering and ID3 decision tree learning
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
Yasser Yasami, Saadat Pour Mozaffari
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 8 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
WIA
2000
Springer
14 years 10 days ago
MONA Implementation Secrets
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
Nils Klarlund, Anders Møller, Michael I. Sc...
DAGM
2008
Springer
13 years 10 months ago
Natural Language Understanding by Combining Statistical Methods and Extended Context-Free Grammars
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
Stefan Schwärzler, Joachim Schenk, Frank Wall...