129 search results - page 10 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
102
Voted
COLOGNETWENTE
2008
15 years 1 months ago
2008
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
UAI
2003
15 years 1 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
123
click to vote
TCS
2011
14 years 6 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Robots are emerging from industrial plants toward every people’s daily life. Thus, navigation in and understanding of human related environments becomes a prerequisit...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...