Sciweavers

327 search results - page 23 / 66
» Algorithms for infinite huffman-codes
Sort
View
ICIP
2003
IEEE
15 years 15 days ago
Fast GEM wavelet-based image deconvolution algorithm
The paper proposes a new wavelet-based Bayesian approach to image deconvolution, under the space-invariant blur and additive white Gaussian noise assumptions. Image deconvolution ...
José M. Bioucas-Dias
SODA
2001
ACM
114views Algorithms» more  SODA 2001»
14 years 8 days ago
Approximation algorithms for TSP with neighborhoods in the plane
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...
Adrian Dumitrescu, Joseph S. B. Mitchell
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 8 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
ICDT
2007
ACM
74views Database» more  ICDT 2007»
14 years 2 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
IFM
2010
Springer
147views Formal Methods» more  IFM 2010»
13 years 8 months ago
Symbolic Model-Checking of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange ...
Hanifa Boucheneb, Abdessamad Imine, Manal Najem