Sciweavers

1284 search results - page 29 / 257
» Data Structures for Mergeable Trees
Sort
View
DATESO
2009
158views Database» more  DATESO 2009»
13 years 4 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
CC
2003
Springer
103views System Software» more  CC 2003»
14 years 9 hour ago
A Pattern Matching Compiler for Multiple Target Languages
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
Pierre-Etienne Moreau, Christophe Ringeissen, Mari...
ISBRA
2010
Springer
13 years 10 months ago
A Novel Approach for Compressing Phylogenetic Trees
Abstract. Phylogenetic trees are tree structures that depict relationships between organisms. Popular analysis techniques often produce large collections of candidate trees, which ...
Suzanne Matthews, Seung-Jin Sul, Tiffani L. Willia...
ICCS
2007
Springer
14 years 28 days ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...
NIPS
2004
13 years 8 months ago
Using Random Forests in the Structured Language Model
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
Peng Xu, Frederick Jelinek