1670 search results - page 106 / 334 » Fast Computation of Data Correlation Using BDDs |
145
click to vote
FTTCS
2006
15 years 3 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
149
click to vote
TKDE
2008
15 years 3 months ago
2008
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...
146
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
127
click to vote
VMV
2004
15 years 4 months ago
2004
The Fourier volume rendering technique operates in the frequency domain and creates line integral projections of a 3D scalar field. These projections can be efficiently generated ...
111
click to vote
ECML
2004
Springer
15 years 8 months ago
2004
Springer
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...