17760 search results - page 273 / 3552 » A Generalization of the Massey-Ding Algorithm |
200
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
199
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for...
182
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The generation of profitable trading rules for Foreign Exchange (FX) investments is a difficult but popular problem. The use of Machine Learning in this problem allows us to obtai...
200
click to vote
CAAN
2007
Springer
16 years 1 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
178
click to vote
CHES
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...