Sciweavers

120 search results - page 17 / 24
» Low Complexity Algorithms for Linear Recurrences
Sort
View
ICCV
2009
IEEE
2171views Computer Vision» more  ICCV 2009»
14 years 11 months ago
Fast Visibility Restoration from a Single Color or Gray Level Image
One source of difficulties when processing outdoor images is the presence of haze, fog or smoke which fades the colors and reduces the contrast of the observed objects. We introdu...
Jean-Philippe Tarel and Nicolas Hautière
WCNC
2008
IEEE
14 years 1 months ago
On the Distribution of Positioning Errors in Wireless Sensor Networks: A Simulative Comparison of Optimization Algorithms
Abstract—Recent advances in the technology of wireless electronic devices have made possible to build ad–hoc Wireless Sensor Networks (WSNs) using inexpensive nodes consisting ...
Stefano Tennina, Marco Di Renzo, Fortunato Santucc...
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
ICDCS
2010
IEEE
13 years 11 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
ICASSP
2008
IEEE
14 years 1 months ago
An invertible quantization based watermarking approach
In this paper a new class of invertible watermarking approach based on quantization has been introduced. Based on the necessary conditions (blindness, reversibility and impercepti...
Mohammad Javad Saberian, Mohammad Ali Akhaee, Faro...