2512 search results - page 16 / 503 » Learning from Highly Structured Data by Decomposition |
105
click to vote
COCOON
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
101
click to vote
NIPS
2008
14 years 11 months ago
2008
Covariance estimation for high dimensional vectors is a classically difficult problem in statistical analysis and machine learning. In this paper, we propose a maximum likelihood ...
153
click to vote
VLSISP
2011
14 years 4 months ago
2011
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
We propose an unconventional but highly effective approach
to robust fitting of multiple structures by using statistical
learning concepts. We design a novel Mercer kernel
for t...