1158 search results - page 72 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
158
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
162
Voted
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
142
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
117
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ï...
130
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: Dekapentagonal maps depict the phylogenetic relationships of five genomes in a visually appealing diagram and can be viewed as an alternative to a single evolutionary ...