Sciweavers

8669 search results - page 58 / 1734
» Computing matrix representations
Sort
View
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta
DCC
2011
IEEE
12 years 11 months ago
Hadamard matrices of order 32 and extremal ternary self-dual codes
A ternary self-dual code can be constructed from a Hadamard matrix of order congruent to 8 modulo 12. In this paper, we show that the Paley-Hadamard matrix is the only Hadamard ma...
Koichi Betsumiya, Masaaki Harada, Hiroshi Kimura
JAT
2010
51views more  JAT 2010»
13 years 2 months ago
Optimal adaptive computations in the Jaffard algebra and localized frames
We study the efficient numerical solution of infinite matrix equations Au = f for a matrix A in the Jaffard algebra. These matrices appear naturally via frame discretizations in m...
Stephan Dahlke, Massimo Fornasier, Karlheinz Gr&ou...
ICS
1997
Tsinghua U.
13 years 12 months ago
Sparse Code Generation for Imperfectly Nested Loops with Dependences
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
Vladimir Kotlyar, Keshav Pingali
INFORMATICALT
2007
104views more  INFORMATICALT 2007»
13 years 7 months ago
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...