Sciweavers

3454 search results - page 331 / 691
» Modern computer algebra
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
Compact Representation of Multidimensional Data Using Tensor Rank-One Decomposition
This paper presents a new approach for representing multidimensional data by a compact number of bases. We consider the multidimensional data as tensors instead of matrices or vec...
Hongcheng Wang, Narendra Ahuja
CVPR
1998
IEEE
16 years 7 months ago
A New Complex Basis for Implicit Polynomial Curves and its Simple Exploitation for Pose Estimation and Invariant Recognition
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
David B. Cooper, Jean-Philippe Tarel
DCC
2008
IEEE
16 years 6 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
DCC
2004
IEEE
16 years 6 months ago
Parameter Inequalities for Orthogonal Arrays with Mixed Levels
An important question in the construction of orthogonal arrays is what the minimal size of an array is when all other parameters are fixed. In this paper, we will provide a genera...
Wiebke S. Diestelkamp
LICS
2009
IEEE
16 years 1 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson