93 search results - page 4 / 19 » The complexity of the weight problem for permutation and mat... |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
INFORMATICALT
2007
13 years 7 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
MOC
2002
13 years 7 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
LSSC
2005
Springer
14 years 29 days ago
2005
Springer
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...