129 search results - page 11 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
87
Voted
IJCAI
2003
15 years 1 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
87
Voted
IRI
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly impr...
ALGORITHMICA
2007
14 years 11 months ago
2007
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
ICA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
100
click to vote
KDD
2006
ACM
16 years 2 days ago
2006
ACM
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...