565 search results - page 44 / 113 » Colorization by Matrix Completion |
118
click to vote
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
BIOINFORMATICS
2000
15 years 1 months ago
2000
Motivation: Efficient, accurate and automatic clustering of large protein sequence datasets, such as complete proteomes, into families, according to sequence similarity. Detection...
SIAMMAX
2010
14 years 8 months ago
2010
We investigate the structural, spectral, and sparsity properties of Stochastic Galerkin matrices as they arise in the discretization of linear differential equations with random co...
121
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
113
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...