131 search results - page 2 / 27 » A General Method for Reducing the Complexity of Relational I... |
ICA
2004
Springer
13 years 10 months ago
2004
Springer
Presented here is a generalization of the modified relative Newton method, recently proposed in [1] for quasi-maximum likelihood blind source separation. Special structure of the ...
ICCAD
2002
IEEE
13 years 9 months ago
2002
IEEE
The paper describes the folding method of logic functions to reduce the size of memories for keeping the functions. The folding is based on the relation of fractions of logic func...
TIT
1998
13 years 4 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
SOSP
2007
ACM
14 years 1 months ago
2007
ACM
Software defects significantly reduce system dependability. Among various types of software bugs, semantic and concurrency bugs are two of the most difficult to detect. This pape...
CASC
2006
Springer
13 years 8 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...