Sciweavers

652 search results - page 51 / 131
» fast 2004
Sort
View
ISBI
2004
IEEE
14 years 8 months ago
Quasi-Maximum Likelihood Blind Deconvolution of Images Acquired Through Scattering Media
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...
Michael M. Bronstein, Alexander M. Bronstein, Yeho...
WWW
2004
ACM
14 years 8 months ago
An outsider's view on "topic-oriented blogging"
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...
Judit Bar-Ilan
AMAI
2004
Springer
14 years 1 months ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
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 ...
Justin Pearson
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
14 years 1 months ago
A Binary Recursive Gcd Algorithm
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...
Damien Stehlé, Paul Zimmermann
ATAL
2004
Springer
14 years 1 months ago
Mapping Mental States into Propositional Planning
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...
Felipe Rech Meneguzzi, Avelino F. Zorzo, Michael C...