Sciweavers

1099 search results - page 94 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
ACL
2010
14 years 8 months ago
Tree-Based Deterministic Dependency Parsing - An Application to Nivre's Method -
Nivre's method was improved by enhancing deterministic dependency parsing through application of a tree-based model. The model considers all words necessary for selection of ...
Kotaro Kitagawa, Kumiko Tanaka-Ishii
ICDM
2006
IEEE
122views Data Mining» more  ICDM 2006»
15 years 4 months ago
Optimal Segmentation Using Tree Models
Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunications. Many real-life sequences have a strong segmental str...
Robert Gwadera, Aristides Gionis, Heikki Mannila
NCA
2006
IEEE
14 years 10 months ago
Open-loop regulation and tracking control based on a genealogical decision tree
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
Kaddour Najim, Enso Ikonen, P. Del Moral
COMGEO
2004
ACM
14 years 9 months ago
The weighted farthest color Voronoi diagram on trees and graphs
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera ...
IPL
2010
71views more  IPL 2010»
14 years 8 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson