212 search results - page 23 / 43 » On Lengths of Rainbow Cycles |
CPM
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
SAMOS
2007
Springer
14 years 3 months ago
2007
Springer
An integral part of FFT computation are the twiddle factors, which, in software implementations, are typically stored into RAM memory implying large memory footprint and power cons...
DATE
2002
IEEE
14 years 2 months ago
2002
IEEE
This paper explores the role of data analysis methods to support system-level designers in characterising the performance of embedded applications. In particular, we address the p...
BIBM
2008
IEEE
13 years 11 months ago
2008
IEEE
: The analysis of Biological Regulatory Network (BRN) leads to compute the set of the possible behaviours of the biological components. These behaviours are seen as trajectories an...
DM
1998
13 years 9 months ago
1998
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...