Sciweavers

475 search results - page 44 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 7 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
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...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
CVPR
2010
IEEE
15 years 1 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
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...
Jonathan Brandt
COLT
2008
Springer
15 years 4 months ago
Time Varying Undirected Graphs
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
GEOINFORMATICA
2007
111views more  GEOINFORMATICA 2007»
15 years 2 months ago
LiDAR-Derived High Quality Ground Control Information and DEM for Image Orthorectification
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...
JMLR
2008
133views more  JMLR 2008»
15 years 2 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan