Sciweavers

178 search results - page 26 / 36
» combinatorics 2007
Sort
View
COCOON
2007
Springer
15 years 5 months ago
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
George Christodoulou, Laurent Gourvès, Fann...
COCOON
2007
Springer
15 years 7 months ago
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
Tandem repeated regions are closely related to some genetic diseases in human beings. Once a region containing pseudo-periodic repeats is found, it is interesting to study the his...
Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen
CPM
2007
Springer
167views Combinatorics» more  CPM 2007»
15 years 7 months ago
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the ...
Amihood Amir, Oren Kapah, Ely Porat
APPML
2002
76views more  APPML 2002»
15 years 1 months ago
Proper gromov transforms of metrics are metrics
In phylogenetic analysis, a standard problem is to approximate a given metric by an additive metric. Here it is shown that, given a metric D defined on some finite set X and a non...
Andreas W. M. Dress
EJC
2010
15 years 1 months ago
Bijections for a class of labeled plane trees
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
Nancy S. S. Gu, Helmut Prodinger, Stephan Wagner