591 search results - page 61 / 119 » An Efficient Algorithm for Local Distance Metric Learning |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
119
click to vote
BMCBI
2007
14 years 9 months ago
2007
Background: The underlying goal of microarray experiments is to identify gene expression patterns across different experimental conditions. Genes that are contained in a particula...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
AAAI
2008
15 years 1 days ago
2008
Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-...