42 search results - page 1 / 9 » On Euclidean Embeddings and Bandwidth Minimization |
RANDOM
2001
Springer
13 years 8 months ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
COLT
2001
Springer
13 years 8 months ago
2001
Springer
The notion of embedding a class of dichotomies in a class of linear half spaces is central to the support vector machines paradigm. We examine the question of determining the mini...
ICPR
2010
IEEE
13 years 2 months ago
2010
IEEE
Similarity based pattern recognition is concerned with the analysis of patterns that are specified in terms of object dissimilarity or proximity rather than ordinal values. For man...
GD
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...