Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman
Orthophotos (or orthoimages if in digital form) have long been recognised as a supplement or alternative to standard maps. The increasing applications of orthoimages require effor...
Xiaoye Liu, Zhenyu Zhang, Jim Peterson, Shobhit Ch...
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...