This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Large intersubject variability is a well-described feature of fMRI studies, making inter-group inference, of critical importance for biological interpretation, difficult. Therefor...
Martin J. McKeown, Junning Li, Xuemei Huang, Z. Ja...