Sciweavers

16430 search results - page 175 / 3286
» On Computable Tree Functions
Sort
View
CGF
2002
116views more  CGF 2002»
15 years 3 months ago
Deferred, Self-Organizing BSP Trees
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...
Sigal Ar, Gil Montag, Ayellet Tal
ACL
2003
15 years 5 months ago
Loosely Tree-Based Alignment for Machine Translation
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...
Daniel Gildea
TKDE
2008
153views more  TKDE 2008»
15 years 3 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
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...
Sen Zhang, Jason Tsong-Li Wang
ECUMN
2007
Springer
15 years 10 months ago
Multicast Extension of Unicast Charging for QoS Services
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...
Antonio Bueno, Pere Vilà, Ramón Fabr...
IPPS
2006
IEEE
15 years 10 months ago
An overview of the Jahob analysis system: project goals and current status
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...
Viktor Kuncak, Martin C. Rinard