Sciweavers

78 search results - page 11 / 16
» Large Equiangular Sets of Lines in Euclidean Space
Sort
View
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
13 years 8 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 8 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
PAMI
2006
134views more  PAMI 2006»
13 years 7 months ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee
ICMLA
2010
13 years 5 months ago
Smoothing Gene Expression Using Biological Networks
Gene expression (microarray) data have been used widely in bioinformatics. The expression data of a large number of genes from small numbers of subjects are used to identify inform...
Yue Fan, Mark A. Kon, Shinuk Kim, Charles DeLisi
MVA
1990
123views Computer Vision» more  MVA 1990»
13 years 8 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu