Sciweavers

263 search results - page 42 / 53
» Rigid Tree Automata
Sort
View
PPDP
2010
Springer
13 years 4 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch
SPAA
2010
ACM
13 years 11 months ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 6 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
ACL
2010
13 years 4 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 5 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