16430 search results - page 472 / 3286 » On Computable Tree Functions |
179
click to vote
SCCC
2003
IEEE
16 years 6 days ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
211
click to vote
NETWORKING
2007
15 years 8 months ago
2007
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
179
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
179
click to vote
WOB
2004
15 years 8 months ago
2004
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
158
click to vote
COLING
2002
15 years 6 months ago
2002
In this paper, we present a parser based on a stochastic structured language model (SLM) with a
exible history reference mechanism. An SLM is an alternative to an n-gram model as...