16430 search results - page 175 / 3286 » On Computable Tree Functions |
157
click to vote
CGF
2002
15 years 6 months ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
140
click to vote
ACL
2003
15 years 8 months ago
2003
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...
218
click to vote
TKDE
2008
15 years 6 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
150
Voted
ECUMN
2007
Springer
16 years 1 months ago
2007
Springer
In order to successfully deploy multicast services in QoS-aware networks, pricing architectures must take into account the particular characteristics of multicast sessions. With t...
179
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...