Abstract— In this paper, we study the use of cooperation as a technique for designing faster algorithms for reconstructing phylogenetic trees. Our focus is on the use of cooperat...
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
In this paper, we introduce new multiscale AM-FM demodulation algorithms that provide significant improvements in accuracy over previously reported approaches. The improvements ar...
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...