Sciweavers

12825 search results - page 373 / 2565
» Improved PLSOM algorithm
Sort
View
CIBCB
2005
IEEE
16 years 1 months ago
Cooperative Rec-I-DCM3: A Population-Based Approach for Reconstructing Phylogenies
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...
Tiffani Williams, Marc Smith
ADHOCNOW
2008
Springer
16 years 1 months ago
Approximating Minimum-Power k-Connectivity
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...
Zeev Nutov
BMCBI
2006
142views more  BMCBI 2006»
15 years 7 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
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. ...
Yuanyuan Ding, Dawn Wilkins
ICIP
2007
IEEE
16 years 9 months ago
Robust Multiscale AM-FM Demodulation of Digital Images
In this paper, we introduce new multiscale AM-FM demodulation algorithms that provide significant improvements in accuracy over previously reported approaches. The improvements ar...
Marios S. Pattichis, Paul V. Rodriguez, Víc...
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 2 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
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...
Noga Alon, Rina Panigrahy, Sergey Yekhanin