2899 search results - page 86 / 580 » Dynamic Trees in Practice |
132
Voted
IS
2011
14 years 9 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...
121
Voted
AUSAI
2006
Springer
15 years 6 months 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...
123
Voted
SODA
1994
ACM
15 years 4 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...
145
Voted
BMCBI
2011
14 years 9 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 ...
137
Voted
CDC
2008
IEEE
15 years 4 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...