Sciweavers

6358 search results - page 347 / 1272
» Computing spectral sequences
Sort
View
NIPS
2004
15 years 8 months ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
WSCG
2001
134views more  WSCG 2001»
15 years 8 months ago
Synthetic Images of Underwater Scenes: A First Approximation
The creation and rendering of realistic water scenes is one of the challenging tasks in Computer Graphics. To reproduce the illumination and colour inside water bodies an algorith...
Eva Cerezo, Francisco J. Serón
ICML
2010
IEEE
15 years 7 months ago
Power Iteration Clustering
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...
Frank Lin, William W. Cohen
AUTOMATICA
2006
70views more  AUTOMATICA 2006»
15 years 6 months ago
A Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
Juan Carlos Zúñiga, Didier Henrion
MOR
2008
110views more  MOR 2008»
15 years 6 months ago
Alternating Projections on Manifolds
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...
Adrian S. Lewis, Jérôme Malick