2168 search results - page 204 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
140
click to vote
FCCM
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper proposes a high performance least square solver on FPGAs using the Cholesky decomposition method. Our design can be realized by iteratively adopting a single triangular...
125
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
bstraction of Wildlife Footage using Gaussian Mixture Models and the Minimum Description Length Criterion David Gibson Neill Campbell Barry Thomas Department of Computer Science Un...
130
click to vote
COMPUTING
2006
15 years 4 months ago
2006
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
149
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
122
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...