Sciweavers

1284 search results - page 87 / 257
» Data Structures for Mergeable Trees
Sort
View
CORR
1999
Springer
118views Education» more  CORR 1999»
13 years 7 months ago
Supervised Grammar Induction Using Training Data with Limited Constituent Information
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...
Rebecca Hwa
PVLDB
2008
167views more  PVLDB 2008»
13 years 6 months ago
Keyword search on external memory data graphs
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...
IFSA
2007
Springer
133views Fuzzy Logic» more  IFSA 2007»
14 years 1 months ago
Fuzzy Tree Mining: Go Soft on Your Nodes
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
Federico Del Razo López, Anne Laurent, Pasc...
CORR
2004
Springer
118views Education» more  CORR 2004»
13 years 7 months ago
Understanding Search Trees via Statistical Physics
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
ICDM
2006
IEEE
122views Data Mining» more  ICDM 2006»
14 years 1 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