652 search results - page 51 / 131 » fast 2004 |
148
click to vote
ISBI
2004
IEEE
16 years 6 months ago
2004
IEEE
We address the problem of restoration of images obtained through a scattering medium. We present an efficient quasimaximum likelihood blind deconvolution approach based on the fas...
WWW
2004
ACM
16 years 6 months ago
2004
ACM
The number of Web blogs is growing extremely fast, thus this phenomenon cannot be ignored. This paper discusses the issue through monitoring a set of blogs for a two months period...
152
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
149
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
166
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
Most BDI agent architectures rely on plan libraries in order to ensure bounded time for means-ends reasoning. Nevertheless, the usage of fast planning algorithms to provide the ag...