Sciweavers

2382 search results - page 99 / 477
» Generating Seeded Trees from Data Sets
Sort
View
COLING
1996
15 years 5 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
JCB
2008
91views more  JCB 2008»
15 years 4 months ago
Computational Quantification of Peptides from LC-MS Data
Liquid chromatography coupled to mass spectrometry (LC-MS) has become a major tool for the study of biological processes. High-throughput LC-MS experiments are frequently conducte...
Ole Schulz-Trieglaff, Rene Hussong, Clemens Gr&oum...
JCB
2007
130views more  JCB 2007»
15 years 4 months ago
Bayesian Inference of MicroRNA Targets from Sequence and Expression Data
MicroRNAs (miRNAs) regulate a large proportion of mammalian genes by hybridizing to targeted messenger RNAs (mRNAs) and down-regulating their translation into protein. Although mu...
Jim C. Huang, Quaid Morris, Brendan J. Frey
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
15 years 11 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
VLDB
2007
ACM
118views Database» more  VLDB 2007»
16 years 4 months ago
Inferring XML Schema Definitions from XML Data
Although the presence of a schema enables many optimizations for operations on XML documents, recent studies have shown that many XML documents in practice either do not refer to ...
Geert Jan Bex, Frank Neven, Stijn Vansummeren