13603 search results - page 206 / 2721 » On the Computational Complexity of Cut-Reduction |
161
click to vote
AMC
2008
15 years 6 months ago
2008
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While m...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
208
click to vote
GPC
2009
Springer
15 years 4 months ago
2009
Springer
Grid computing involves the ability to harness together the power of computing resources. In this paper we push forward this philosophy and show technologies enabling federation o...
152
click to vote
AAAI
2004
15 years 8 months ago
2004
Computer systems are rapidly becoming so complex that maintaining them with human support staffs will be prohibitively expensive and inefficient. In response, visionaries have beg...
179
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...