Sciweavers

112
Voted
IJCV
2000
133views more  IJCV 2000»
15 years 18 days ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
97
Voted
SIAMSC
2008
187views more  SIAMSC 2008»
15 years 21 days ago
The Generalized Singular Value Decomposition and the Method of Particular Solutions
A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...
Timo Betcke
112
Voted
BMCBI
2008
138views more  BMCBI 2008»
15 years 27 days ago
Combining transcriptional datasets using the generalized singular value decomposition
Background: Both microarrays and quantitative real-time PCR are convenient tools for studying the transcriptional levels of genes. The former is preferable for large scale studies...
Andreas W. Schreiber, Neil J. Shirley, Rachel A. B...