Sciweavers

563 search results - page 2 / 113
» Computing approximate PSD factorizations
Sort
View
TKDE
2012
270views Formal Methods» more  TKDE 2012»
11 years 8 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
FCT
2007
Springer
14 years 4 days ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
COMPUTING
2000
89views more  COMPUTING 2000»
13 years 5 months ago
Condition Numbers of Approximate Schur Complements in Two- and Three-Dimensional Discretizations on Hierarchically Ordered Grids
We investigate multilevel incomplete factorizations of M-matrices arising from
J. K. Kraus, C. W. Brand
TOG
2002
129views more  TOG 2002»
13 years 5 months ago
Homomorphic factorization of BRDF-based lighting computation
Several techniques have been developed to approximate Bidirectional Reflectance Distribution Functions (BRDF) with acceptable quality and performance for realtime applications. Th...
Lutz Latta, Andreas Kolb