Sciweavers

999 search results - page 33 / 200
» Spectral simplex method
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
NIPS
2004
14 years 11 months ago
Limits of Spectral Clustering
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
WSCG
2004
135views more  WSCG 2004»
14 years 11 months ago
Practical Construction of Reflectances for Spectral Rendering
We propose a method to construct practical reflectances for spectral rendering. A set of 1400 real reflectances are measured and more spectra with higher saturated colors are gene...
Qiqi Wang, Haiying Xu, Yinlong Sun
EDUTAINMENT
2010
Springer
14 years 8 months ago
Spectrally-Based Single Image Relighting
Abstract. This paper presents a new spectrally-based single image relighting approach. We first compute the spectral radiance of each stimulus on the monitor when displaying the i...
Xiaoxiong Xing, Weiming Dong, Xiaopeng Zhang, Jean...
MOC
2010
14 years 4 months ago
Convergence analysis of the Jacobi spectral-collocation methods for Volterra integral equations with a weakly singular kernel
In this paper, a Jacobi-collocation spectral method is developed for Volterra integral equations of the second kind with a weakly singular kernel. We use some function transformati...
Yanping Chen, Tao Tang