Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
This paper presents a general virtual ring method to design and analyze small-world structured P2P networks on the base es embedded in ID spaces with distance metric. Its basic ide...
We introduce a novel algorithm for the design of fast slice-selective spatially-tailored magnetic resonance imaging (MRI) excitation pulses. This method, based on sparse approximat...
Adam C. Zelinski, Lawrence L. Wald, K. Setsompop, ...
This paper studies the effect of discretizing the parametrization of a dictionary in the particular context of Matching Pursuit decompositions of signals. Our approach relies on th...
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...