129 search results - page 3 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
CPAIOR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
WCNC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
ISIM
2007
13 years 8 months ago
2007
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
MOR
2007
13 years 6 months ago
2007
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...