Sciweavers

824 search results - page 162 / 165
» Weighted Low-Rank Approximations
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
PAMI
2006
221views more  PAMI 2006»
13 years 7 months ago
Face Recognition from a Single Training Image under Arbitrary Unknown Lighting Using Spherical Harmonics
In this paper, we propose two novel methods for face recognition under arbitrary unknown lighting by using spherical harmonics illumination representation, which require only one t...
Lei Zhang 0002, Dimitris Samaras
BMCBI
2005
116views more  BMCBI 2005»
13 years 7 months ago
SuperLigands - a database of ligand structures derived from the Protein Data Bank
Background: Currently, the PDB contains approximately 29,000 protein structures comprising over 70,000 experimentally determined three-dimensional structures of over 5,000 differe...
Elke Michalsky, Mathias Dunkel, Andrean Goede, Rob...
JOIN
2007
91views more  JOIN 2007»
13 years 7 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 7 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin