1004 search results - page 108 / 201 » Product representations of polynomials |
178
Voted
CTRSA
2005
Springer
16 years 13 days ago
2005
Springer
This work proposes a compact implementation of the AES S-box using composite field arithmetic in GF(((22 ) 2 ) 2 ). It describes a systematic exploration of different choices for...
169
click to vote
FORMATS
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
142
click to vote
ICALP
2004
Springer
16 years 8 days ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
178
click to vote
ICIP
2010
IEEE
16 years 5 days ago
2010
IEEE
We propose a registration method to find affine transformations
between 3D objects by constructing and solving an
overdetermined system of polynomial equations. We utilize
voxel...
189
click to vote
ICCS
2003
Springer
16 years 3 days ago
2003
Springer
Research on semantic search has become heated these years. In this paper we propose an approach focusing on searching for resources with descriptions. The knowledge representation ...