17760 search results - page 241 / 3552 » A Generalization of the Massey-Ding Algorithm |
157
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We show that partial 2-tree canonization, and hence isomorphism testing for partial 2-trees, is in deterministic logspace. Our algorithm involves two steps: (a) We exploi...
182
click to vote
NIPS
2001
15 years 8 months ago
2001
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
144
click to vote
NIPS
1996
15 years 8 months ago
1996
This paper compares three penalty terms with respect to the efficiency of supervised learning, by using first- and second-order learning algorithms. Our experiments showed that fo...
184
Voted
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
170
click to vote
SIPS
2007
IEEE
16 years 28 days ago
2007
IEEE
In this paper, we investigate the efficient software implementations of the Montgomery modular multiplication algorithm on a multi-core system. A HW/SW co-design technique is use...