Sciweavers

292 search results - page 15 / 59
» A decentralized algorithm for spectral analysis
Sort
View
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
SMI
2003
IEEE
131views Image Analysis» more  SMI 2003»
14 years 29 days ago
Watermarking 2D Vector Maps in the Mesh-Spectral Domain
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...
Ryutarou Ohbuchi, Hiroo Ueda, Shuh Endoh
BMCV
2000
Springer
14 years 1 days ago
The Spectral Independent Components of Natural Scenes
Abstract. We apply independent component analysis (ICA) for learning an efficient color image representation of natural scenes. In the spectra of single pixels, the algorithm was a...
Te-Won Lee, Thomas Wachtler, Terrence J. Sejnowski
JMLR
2010
198views more  JMLR 2010»
13 years 6 months ago
On Learning with Integral Operators
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...
Lorenzo Rosasco, Mikhail Belkin, Ernesto De Vito
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 11 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...