Results 11  20
of
414,729
Common Persistence in Conditional Variances
 ECONOMETRIC REVIEWS
, 1993
"... Since the introduction of the autoregressive conditional heteroskedastic (ARCH) model in Engle (1982), numerous applications of this modeling strategy have already appeared. A common finding in many of these studies with high frequency financial or monetary data concerns the presence of an approxima ..."
Abstract

Cited by 331 (20 self)
 Add to MetaCart
of an approximate unit root in the autoregressive polynomial in the univariate time series representation for the conditional second order moments of the process, as in the socalled integrated generalized ARCH (IGARCH) class of models proposed in Engle and Bollerslev (1986). In the IGARCH models shocks
Seriesparallel networks
, 2003
"... Series and parallel connections are usually first encountered in the study of electrical circuits. Our approach is to first examine a relevant class of partially ordered sets (posets) and then to define seriesparallel networks by analogy [1]. Interesting asymptotic constants appear everywhere, sim ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Series and parallel connections are usually first encountered in the study of electrical circuits. Our approach is to first examine a relevant class of partially ordered sets (posets) and then to define seriesparallel networks by analogy [1]. Interesting asymptotic constants appear everywhere
Scheduling UETUCT SeriesParallel Graphs on Two Processors
 THEORETICAL COMPUTER SCIENCE
, 1996
"... The scheduling of task graphs on two identical processors is considered. It is assumed that tasks have unitexecutiontime, and arcs are associated with unitcommunicationtime delays. The problem is to assign the tasks to the two processors and schedule their execution in order to minimize the make ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
the makespan. A quadratic algorithm is proposed to compute an optimal schedule for a class of seriesparallel graphs, called SP1 graphs, which includes in particular inforests and outforests.
Compositions of seriesparallel graphs
, 2006
"... A composition of a graph is a partition of the vertex set such that the subgraph induced by each part is connected. In this paper we shall survey past results about compositions of graphs and present a new result which yields a lineartime method for computing the number of compositions of a series ..."
Abstract
 Add to MetaCart
A composition of a graph is a partition of the vertex set such that the subgraph induced by each part is connected. In this paper we shall survey past results about compositions of graphs and present a new result which yields a lineartime method for computing the number of compositions of a seriesparallel
Bounds on seriesparallel slowdown
, 904
"... We use activity networks (task graphs) to model parallel programs and consider seriesparallel extensions of these networks. Our motivation is twofold: the benefits of seriesparallel activity networks and the modelling of programming constructs, such as those imposed by current parallel computing ..."
Abstract
 Add to MetaCart
We use activity networks (task graphs) to model parallel programs and consider seriesparallel extensions of these networks. Our motivation is twofold: the benefits of seriesparallel activity networks and the modelling of programming constructs, such as those imposed by current parallel computing
On maltsev digraphs
 In Computer Science–Theory and Applications
, 2011
"... We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles, showing in this way that the constraint satisfaction problem for Maltsev digraphs is in logspace, L. We then generalize r ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
preserved by a Maltsev operation, and relate them with series parallel digraphs. 1
A lower bound on the size of seriesparallel graphs dense in long paths
 Electronic Colloquium on Computational Complexity (ECCC), Tech report TR08110, 2008. [Online]. Available: http : / / eccc . hpi  web . de / eccc
"... One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever ≤ n edges are removed, there is still a path from an original input to an original output with ≥ m edges the larger we can make n, m, the denser is the graph. For a given n, m, we would like to ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
to lower bound the size such a graph, say in edges, at least when restricting to a particular class of graphs. A bound of Ω(n lg m) was provided in [Val77] for one notion of seriesparallel graphs. Here we reprove the same result but in greater detail and relate that notion of seriesparallel to other
Linkless symmetric drawings of series parallel digraphs
, 2004
"... In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic criteri ..."
Abstract
 Add to MetaCart
In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic
Results 11  20
of
414,729