Sciweavers

114 search results - page 3 / 23
» Dynamic Spatial Approximation Trees for Massive Data
Sort
View
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 9 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
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...
Ryan Riegel, Alexander Gray, Gordon Richards
ICPR
2008
IEEE
14 years 9 months ago
Approximating a non-homogeneous HMM with Dynamic Spatial Dirichlet Process
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 ...
Haijun Ren, Leon N. Cooper, Liang Wu, Predrag Nesk...
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 8 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
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...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
MIAR
2006
IEEE
14 years 1 months ago
Cerebral Vascular Tree Matching of 3D-RA Data Based on Tree Edit Distance
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 ...
Tommy W. H. Tang, Albert C. S. Chung
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 2 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
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...
Joshua L. Payne, Margaret J. Eppstein