Sciweavers

535 search results - page 31 / 107
» Generalized Version Space Trees
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 3 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
JACM
2006
112views more  JACM 2006»
14 years 11 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
MFCS
2009
Springer
15 years 6 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ICCV
2011
IEEE
13 years 11 months ago
Means in spaces of tree-like shapes
The mean is often the most important statistic of a dataset as it provides a single point that summarizes the entire set. While the mean is readily defined and computed in Euclid...
Aasa Feragen, Søren Hauberg, Mads Nielsen, Franç...
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 13 days ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah