Sciweavers

288 search results - page 14 / 58
» Recent progress in quantum algorithms
Sort
View
CVPR
2009
IEEE
1866views Computer Vision» more  CVPR 2009»
15 years 4 months ago
Understanding and evaluating blind deconvolution algorithms
Blind deconvolution is the recovery of a sharp version of a blurred image when the blur kernel is unknown. Recent algorithms have afforded dramatic progress, yet many aspects of...
Anat Levin, Yair Weiss, Frédo Durand, Willi...
SOFSEM
2009
Springer
14 years 1 months ago
Randomness and Determination, from Physics and Computing towards Biology
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
Giuseppe Longo
DFG
1992
Springer
14 years 26 days ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
ICMS
2010
13 years 7 months ago
Exact Geometric and Algebraic Computations in CGAL
We summarize recent progress and on-going developments for exact geometric and algebraic computations within the Computational Geometry Algorithms Library (Cgal). We detail the exi...
Menelaos I. Karavelas
RP
2010
Springer
118views Control Systems» more  RP 2010»
13 years 6 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa