114 search results - page 3 / 23 » Dynamic Spatial Approximation Trees for Massive Data |
139
Voted
SDM
2008
SIAM
15 years 4 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
122
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...
146
Voted
CPHYSICS
2006
15 years 2 months ago
2006
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
149
click to vote
MIAR
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
149
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...