129 search results - page 9 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
ICN
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap...
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
ICASSP
2011
IEEE
13 years 4 days ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
TSP
2008
13 years 8 months ago
2008
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
JCC
2010
13 years 6 months ago
2010
: Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorith...