Sciweavers

137 search results - page 15 / 28
» Ordinal Embedding: Approximation Algorithms and Dimensionali...
Sort
View
COLING
2008
13 years 9 months ago
Using Three Way Data for Word Sense Discrimination
In this paper, an extension of a dimensionality reduction algorithm called NONNEGATIVE MATRIX FACTORIZATION is presented that combines both `bag of words' data and syntactic ...
Tim Van de Cruys
NIPS
2003
13 years 9 months ago
Non-linear CCA and PCA by Alignment of Local Models
We propose a non-linear Canonical Correlation Analysis (CCA) method which works by coordinating or aligning mixtures of linear models. In the same way that CCA extends the idea of...
Jakob J. Verbeek, Sam T. Roweis, Nikos A. Vlassis
GD
2006
Springer
13 years 11 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
CVPR
2004
IEEE
14 years 9 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 10 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy