1004 search results - page 108 / 201 » Product representations of polynomials |
94
Voted
CTRSA
2005
Springer
15 years 6 months 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...
FORMATS
2004
Springer
15 years 6 months 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...
84
Voted
ICALP
2004
Springer
15 years 6 months 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...
ICIP
2010
IEEE
15 years 6 months 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...
113
Voted
ICCS
2003
Springer
15 years 6 months 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 ...