Sciweavers

137 search results - page 13 / 28
» Ordinal Embedding: Approximation Algorithms and Dimensionali...
Sort
View
BMCBI
2010
243views more  BMCBI 2010»
13 years 7 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
CORR
2012
Springer
171views Education» more  CORR 2012»
12 years 3 months ago
Random Feature Maps for Dot Product Kernels
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and...
Purushottam Kar, Harish Karnick
ICIP
2005
IEEE
14 years 9 months ago
An efficient algorithm for informed embedding of dirty-paper trellis codes for watermarking
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
Gwenaël J. Doërr, Ingemar J. Cox, Lin Li...
CVPR
2008
IEEE
14 years 9 months ago
Large-scale manifold learning
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
Ameet Talwalkar, Sanjiv Kumar, Henry A. Rowley
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
14 years 1 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket