Sciweavers

1284 search results - page 116 / 257
» Data Structures for Mergeable Trees
Sort
View
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
14 years 1 months ago
Proving Termination of Tree Manipulating Programs
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
ACL
2007
13 years 9 months ago
Generalizing Tree Transformations for Inductive Dependency Parsing
Previous studies in data-driven dependency parsing have shown that tree transformations can improve parsing accuracy for specific parsers and data sets. We investigate to what ex...
Jens Nilsson, Joakim Nivre, Johan Hall
ICML
2004
IEEE
14 years 1 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
VL
1992
IEEE
135views Visual Languages» more  VL 1992»
13 years 11 months ago
Tidy Animations of Tree Algorithms
In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. In thi...
John T. Stasko, Carlton Reid Turner
NIPS
2007
13 years 9 months ago
Learning with Tree-Averaged Densities and Distributions
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
Sergey Kirshner