Sciweavers

1000 search results - page 56 / 200
» Dependency Tree Automata
Sort
View
CPC
2008
135views more  CPC 2008»
14 years 12 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
COLING
2010
14 years 6 months ago
Notes on the Evaluation of Dependency Parsers Obtained Through Cross-Lingual Projection
In this paper we address methodological issues in the evaluation of a projectionbased framework for dependency parsing in which annotations for a source language are transfered to...
Kathrin Spreyer
DLOG
2007
15 years 2 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
CORR
2010
Springer
79views Education» more  CORR 2010»
14 years 12 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
ISCIS
2009
Springer
15 years 4 months ago
Calculating the VC-dimension of decision trees
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
Ozlem Asian, Olcay Taner Yildiz, Ethem Alpaydin