Sciweavers

192 search results - page 19 / 39
» Arithmetic Optimization Using Carry-Save-Adders
Sort
View
DSMML
2004
Springer
13 years 11 months ago
Efficient Communication by Breathing
The arithmetic-coding-based communication system, Dasher, can be driven by a one-dimensional continuous signal. A belt-mounted breath-mouse, delivering a signal related to lung vol...
Tom Shorrock, David MacKay, Chris Ball
IACR
2011
212views more  IACR 2011»
12 years 7 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
DATE
2009
IEEE
112views Hardware» more  DATE 2009»
14 years 2 months ago
Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis
: Common sub-expression elimination (CSE) serves as a useful optimization technique in the synthesis of arithmetic datapaths described at RTL. However, CSE has a limited potential ...
Sivaram Gopalakrishnan, Priyank Kalla
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
13 years 8 months ago
Certifying and repairing solutions to large LPs how good are LP-solvers?
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is general...
Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, K...