Sciweavers

1243 search results - page 62 / 249
» Generating Trees on Multisets
Sort
View
MCU
1998
119views Hardware» more  MCU 1998»
13 years 11 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 3 months ago
Key semantics extraction by dependency tree mining
We propose a new text mining system which extracts characteristic contents from given documents. We define Key semantics as characteristic sub-structures of syntactic dependencie...
Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, ...
DIS
2001
Springer
14 years 2 months ago
Functional Trees
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
Joao Gama
BMCBI
2010
172views more  BMCBI 2010»
13 years 10 months ago
Inferring gene regression networks with model trees
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...
Isabel A. Nepomuceno-Chamorro, Jesús S. Agu...
COLING
1996
13 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an