Sciweavers

3128 search results - page 204 / 626
» Finite element method
Sort
View
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
15 years 7 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
134
Voted
DCG
2002
66views more  DCG 2002»
15 years 3 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
IMPERIAL
1993
15 years 8 months ago
Prioritising Preference Relations
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
Mark Ryan
123
Voted
MCS
2007
Springer
15 years 3 months ago
Elasto-plasticity model in structural optimization of composite materials with periodic microstructures
The paper deals with a structural optimization of composite materials with periodic microstructures invoking an elasto-plasticity model with the von Mises yield criterion. Closest...
Ronald H. W. Hoppe, Svetozara Petrova
ADCM
1998
94views more  ADCM 1998»
15 years 3 months ago
On a vector q-d algorithm
Using the framework provided by Clifford algebras, we consider a noncommutative quotient-difference algorithm for obtaining the elements of a continued fraction corresponding to...
D. E. Roberts