Sciweavers

129 search results - page 16 / 26
» Matrix Decomposition Problem Is Complete for the Average Cas...
Sort
View
JMLR
2008
169views more  JMLR 2008»
13 years 8 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
CDC
2009
IEEE
110views Control Systems» more  CDC 2009»
13 years 6 months ago
Global synchronization of networked systems with bidirectional connections
This paper studies the global synchronization problem of networked systems with bidirectional connections. We introduce a virtual node to produce the reference trajectory which wil...
Ji Xiang, Yanjun Li, Wei Wei
IPPS
2000
IEEE
14 years 25 days ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
EDBT
2006
ACM
103views Database» more  EDBT 2006»
14 years 8 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
SIAMDM
2010
133views more  SIAMDM 2010»
13 years 6 months ago
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gi...