548 search results - page 19 / 110 » Iterated importance sampling in missing data problems |
SPIRE
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
108
Voted
SCIA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
DATAMINE
2006
14 years 11 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
NIPS
2007
15 years 7 days ago
2007
It is becoming increasingly important to learn from a partially-observed random matrix and predict its missing elements. We assume that the entire matrix is a single sample drawn ...
115
click to vote
SDM
2009
SIAM
15 years 8 months ago
2009
SIAM
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...