Sciweavers

1244 search results - page 54 / 249
» Searching in Higher Dimension
Sort
View
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
13 years 11 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 10 months ago
Johnson-Lindenstrauss lemma for circulant matrices
We prove a variant of a Johnson-Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimise the randomness used, is easy to implement and provides ...
Aicke Hinrichs, Jan Vybíral
CAL
2004
13 years 9 months ago
Exploiting Low Entropy to Reduce Wire Delay
Wires shrink less efficiently than transistors. Smaller dimensions increase relative delay and the probability of crosstalk. Solutions to this problem include adding additional lat...
Daniel Citron
VC
2010
177views more  VC 2010»
13 years 8 months ago
Color-to-gray conversion using ISOMAP
In this paper we present a new algorithm to transform an RGB color image to a grayscale image. We propose using non-linear dimension reduction techniques to map higher dimensional ...
Ming Cui, Jiuxiang Hu, Anshuman Razdan, Peter Wonk...
GC
2011
Springer
13 years 1 months ago
A Note on the Complexity of Real Algebraic Hypersurfaces
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
Michael Kerber, Michael Sagraloff