Sciweavers

12194 search results - page 164 / 2439
» cans 2010
Sort
View
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 1 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
85
Voted
ICASSP
2010
IEEE
15 years 29 days ago
On the Shannon capacity of DNA data embedding
This paper firstly gives a brief overview of information embedding in deoxyribonucleic acid (DNA) sequences and its applications. DNA data embedding can be considered as a partic...
Félix Balado
75
Voted
ICASSP
2010
IEEE
15 years 29 days ago
Total-variation regularization with bound constraints
We present a new algorithm for bound-constrained totalvariation (TV) regularization that in comparison with its predecessors is simple, fast, and flexible. We use a splitting app...
Rick Chartrand, Brendt Wohlberg
FMICS
2010
Springer
15 years 29 days ago
Range Analysis of Microcontroller Code Using Bit-Level Congruences
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...
Jörg Brauer, Andy King, Stefan Kowalewski
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 27 days ago
On the Capacity of Non-Coherent Network Coding
The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the c...
Mahdi Jafari Siavoshani, Soheil Mohajer, Christina...