2899 search results - page 86 / 580 » Dynamic Trees in Practice |
IS
2011
13 years 3 months ago
2011
Metric access methods based on hyperplane partitioning have the advantage, compared to the ballpartitioning-based ones, that regions do not overlap. The price is less flexibility...
AUSAI
2006
Springer
14 years 20 days ago
2006
Springer
Establishing relationships within a dataset is one of the core objectives of data mining. In this paper a method of correlating behaviour profiles in a continuous dataset is presen...
SODA
1994
ACM
13 years 10 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
BMCBI
2011
13 years 4 months ago
2011
Background: Large databases of genetic data are often biased in their representation. Thus, selection of genetic data with desired properties, such as evolutionary representation ...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...