455 search results - page 7 / 91 » Dynamic well-spaced point sets |
ISBI
2008
IEEE
14 years 9 months ago
2008
IEEE
A novel 4D level set framework was developed to segment dynamic MR images into the cortex, medulla and collecting system. The novelty of the method is that it combines information...
SIAMCOMP
1998
13 years 8 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
COMGEO
1999
ACM
13 years 8 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
IJBC
2010
13 years 5 months ago
2010
We study returns in dynamical systems: when a set of points, initially populating a prescribed region, swarms around phase space according to a deterministic rule of motion, we sa...
PR
2007
13 years 8 months ago
2007
Given a data set, a dynamical procedure is applied to the data points in order to shrink and separate, possibly overlapping clusters. Namely, Newton’s equations of motion are em...