Sciweavers

198 search results - page 9 / 40
» Computing the Algebraic Immunity Efficiently
Sort
View
AMC
2005
195views more  AMC 2005»
14 years 9 months ago
A new symbolic computational approach to singular initial value problems in the second-order ordinary differential equations
This paper presents a new symbolic algorithm to compute the singular initial value problem of second-order ordinary differential equations using Adomian decomposition method. The ...
Onur Kiymaz, Seref Mirasyedioglu
88
Voted
CADE
2007
Springer
15 years 9 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
DCC
2008
IEEE
15 years 9 months ago
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...
Sumanta Sarkar, Subhamoy Maitra
101
Voted
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
15 years 26 days ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
EWC
2000
106views more  EWC 2000»
14 years 9 months ago
Object Oriented Tools for Scientific Computing
A set of object oriented tools is presented which, when combined, yield an efficient parallel finite element program. Special emphasis is given to details within the concept of the...
Philippe R. B. Devloo