Sciweavers

995 search results - page 53 / 199
» Wire-speed total order
Sort
View
CP
1999
Springer
14 years 1 months ago
The Goldilocks Problem
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
Tudor Hulubei, Eugene C. Freuder
ISMVL
1999
IEEE
133views Hardware» more  ISMVL 1999»
14 years 1 months ago
Ternary Multiplication Circuits Using 4-Input Adder Cells and Carry Look-Ahead
We introduce a new implementation of a ternary adder with four inputs and two outputs. This ternary adder reduces the number of digits in a multiplication compared with a binary m...
Andreas Herrfeld, Siegbert Hentschke
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
14 years 23 days ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
13 years 9 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...
JMIV
2007
136views more  JMIV 2007»
13 years 8 months ago
Image Compression Through a Projection onto a Polyhedral Set
In image denoising, many researchers have tried for several years to combine wavelet-like approaches and optimization methods (typically based on the total variation minimization)...
François Malgouyres