24 search results - page 4 / 5 » jcss 2008 |
JCSS
2010
13 years 3 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
JCSS
2010
13 years 3 months ago
2010
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
JCSS
2008
13 years 4 months ago
2008
Internet worms are classically described using SIR models and simulations, to capture the massive dynamics of the system. Here we are able to generate a differential equation-base...
JCSS
2008
13 years 4 months ago
2008
There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free....
JCSS
2008
13 years 4 months ago
2008
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...