1099 search results - page 168 / 220 » On the Complexity of Computing Evolutionary Trees |
146
click to vote
DAGSTUHL
2004
15 years 5 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
155
click to vote
PRIS
2004
15 years 5 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
152
click to vote
PRL
2008
15 years 4 months ago
2008
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
129
click to vote
SIAMDM
2008
15 years 4 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
156
click to vote
VC
2002
15 years 3 months ago
2002
Implicit surface modeling systems have been used since the mid-1980s for the generation of cartoon-like characters. Recently implicit models combined with constructive solid geome...