Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2012
Springer
207views Education» more  CORR 2012»
8 years 12 months ago
A baby step-giant step roadmap algorithm for general algebraic sets
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
Saugata Basu, Marie-Françoise Roy, Mohab Sa...
IACR
2011
128views more  IACR 2011»
9 years 3 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
ATVA
2011
Springer
213views Hardware» more  ATVA 2011»
9 years 4 months ago
Max and Sum Semantics for Alternating Weighted Automata
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
Shaull Almagor, Orna Kupferman
ICASSP
2011
IEEE
9 years 8 months ago
Nonbinary LDPC decoding by min-sum with Adaptive Message Control
— A new decoding algorithm, referred to as Min-Sum with Adaptive Message Control (AMC-MS), is proposed to reduce the decoding complexity of nonbinary LDPC codes. The proposed alg...
Weiguo Tang, Jie Huang, Lei Wang, Shengli Zhou
CORR
2011
Springer
168views Education» more  CORR 2011»
9 years 11 months ago
Optimal Column-Based Low-Rank Matrix Reconstruction
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
Venkatesan Guruswami, Ali Kemal Sinop
CC
2005
Springer
103views System Software» more  CC 2005»
10 years 4 months ago
Valiant's model and the cost of computing integers
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
Pascal Koiran
CORR
2006
Springer
101views Education» more  CORR 2006»
10 years 4 months ago
Fast computation of power series solutions of systems of differential equations
We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
Alin Bostan, Frédéric Chyzak, Fran&c...
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
10 years 5 months ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote
ANTS
2006
Springer
114views Algorithms» more  ANTS 2006»
10 years 8 months ago
The Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
Jonathan Sorenson
CASES
2009
ACM
10 years 8 months ago
Exploiting residue number system for power-efficient digital signal processing in embedded processors
2's complement number system imposes a fundamental limitation on the power and performance of arithmetic circuits, due to the fundamental need of cross-datapath carry propaga...
Rooju Chokshi, Krzysztof S. Berezowski, Aviral Shr...
books