Sciweavers

264 search results - page 23 / 53
» Decomposing Algebraic Varieties
Sort
View
FFA
2007
62views more  FFA 2007»
13 years 8 months ago
On the parameters of r-dimensional toric codes
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
Diego Ruano
ICPR
2004
IEEE
14 years 9 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
14 years 9 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
ISSAC
2009
Springer
167views Mathematics» more  ISSAC 2009»
14 years 3 months ago
High order derivatives and decomposition of multivariate polynomials
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
Jean-Charles Faugère, Ludovic Perret
ICCD
1996
IEEE
170views Hardware» more  ICCD 1996»
14 years 23 days ago
Boolean Function Representation Based on Disjoint-Support Decompositions
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
Valeria Bertacco, Maurizio Damiani