منابع مشابه
Optimal Partitioning of Sequences
The problem of partitioning a sequence of n real numbers into p intervals is considered. The goal is to find a partition such that the cost of the most expensive interval measured with a cost function f is minimized. An efficient algorithm which solves the problem in time O(p(n − p) log p) is developed. The algorithm is based on finding a sequence of feasible non-optimal partitions, each having...
متن کاملPartitioning Number Sequences into Optimal Subsequences
We consider how to partition finite sequences of positive numbers into subsequences such that each resulting subsequence has a sum of at least a given minimum. Given several different optimality criteria, based on maximising the number of subsequences and minimising their variance in size, we develop and analyse a series of algorithms that yield optimal solutions.
متن کاملEfficient Partitioning of Sequences
Two trees are used sequentially to calculate an approxi-mation to lIA, where 1 IA < 2. These trees calculate the logarithm andexponential, and the division (reciprocation) process can be described by1/A= eAd. For bit skip accuracy of six to 10, this logarithmic-exponential method uses significantly less hardware with respect to thescheme in [3], and the delays may be...
متن کاملPreemptive Online Partitioning of Sequences
Online algorithms process their inputs piece by piece, taking irrevocable decisions for each data item. This model is too restrictive for most partitioning problems, since data that is yet to arrive may render it impossible to extend partial partitionings to the entire data set reasonably well. In this work, we show that preemption might be a potential remedy. We consider the problem of partiti...
متن کاملGlobally Optimal Audio Partitioning
We present a technique for partitioning an audio file into maximally-sized segments having nearly uniform spectral content, ideally corresponding to notes or chords. Our method uses dynamic programming to globally optimize a measure of simplicity or homogeneity of the intervals in the partition. Here we have focused on an entropy-like measure, though there is considerable flexibility in choosin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1995
ISSN: 0196-6774
DOI: 10.1006/jagm.1995.1035