84 search results - page 1 / 17 » Towards Optimal Range Medians |
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
123
Voted
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
105
click to vote
RECOMB
2007
Springer
16 years 6 hour ago
2007
Springer
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
EVOW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
82
Voted
ICANN
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We characterize the first hardware implementation of a selforganizing map algorithm based on axon migration. A population of silicon growth cones automatically wires a t...