Sciweavers

5699 search results - page 163 / 1140
» Alternating model trees
Sort
View
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
15 years 6 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
EMNLP
2010
15 years 3 months ago
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
Phil Blunsom, Trevor Cohn
166
Voted
UTP
2010
15 years 3 months ago
On Modelling User Observations in the UTP
This paper presents an approach for modelling interactions between users and systems in the Unifying Theories of Programming. Working in the predicate calculus, we outline generic ...
Michael J. Banks, Jeremy L. Jacob
ICANN
2010
Springer
15 years 6 months ago
Visualising Clusters in Self-Organising Maps with Minimum Spanning Trees
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
Rudolf Mayer, Andreas Rauber
PODS
2007
ACM
104views Database» more  PODS 2007»
16 years 5 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...