Sciweavers

BIRTHDAY
2012
Springer
12 years 7 months ago
Operand Folding Hardware Multipliers
This paper describes a new accumulate-and-add multiplication algorithm. The method partitions one of the operands and re-combines the results of computations done with each of the ...
Byungchun Chung, Sandra Marcello, Amir-Pasha Mirba...
AAAI
2011
12 years 11 months ago
Lossy Conservative Update (LCU) Sketch: Succinct Approximate Count Storage
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
Amit Goyal, Hal Daumé III
ECCC
2011
203views ECommerce» more  ECCC 2011»
13 years 2 months ago
Accelerated Slide- and LLL-Reduction
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
Claus-Peter Schnorr
JLP
2010
96views more  JLP 2010»
13 years 6 months ago
An overview of the K semantic framework
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
Grigore Rosu, Traian-Florin Serbanuta
SASO
2010
IEEE
13 years 9 months ago
Self-Adaptive Resource Allocation in Open Distributed Systems
In an open distributed system, computational resources are peer-owned, and distributed over time and space. The fact that these resources can dynamically join or leave the system (...
Xinghui Zhao, Nadeem Jamali
ICISS
2010
Springer
13 years 9 months ago
Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems
Existing proposals for end-to-end independently-verifiable (E2E) voting systems require that voters check the presence of a "receipt" on a secure bulletin board. The tall...
Mridul Nandi, Stefan Popoveniuc, Poorvi L. Vora
JCSS
2010
105views more  JCSS 2010»
13 years 10 months ago
Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
Guoqing Liu, Vladik Kreinovich
MST
2007
90views more  MST 2007»
13 years 11 months ago
Optimal Semicomputable Approximations to Reachable and Invariant Sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...
Pieter Collins
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
13 years 11 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
JCNS
2002
114views more  JCNS 2002»
13 years 11 months ago
Computation by Ensemble Synchronization in Recurrent Networks with Synaptic Depression
While computation by ensemble synchronization is considered to be a robust and efficient way for information processing in the cortex (C. Von der Malsburg and W. Schneider (1986) b...
Alex Loebel, Misha Tsodyks