The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computat...

Thenumerical renormalization group is an efficientmethod to diagonalizemodelHamiltonians describing correlated orbitals coupled to conduction states. While only the resulting eigenvalues are needed to calculate the thermodynamical properties for such models, matrix elements of Fermi operators must be evaluated before excitation and transport properties can be computed. The traditional procedure...

This paper presents an adaptive weight computation algorithm for a robust array antenna based on the sample matrix inversion technique. The adaptive array minimizes the mean output power under the constraint that the mean square deviation between the desired and actual responses satisfies a certain magnitude bound. The Lagrange multiplier method is used to solve the constrained minimization pro...

In this paper we investigate the minimal-program complexity of several types of pseudo-recursive and pseudo-random sequences when the resources used for their computation are restricted. For several types of these sequences their minimal-progra m complexity increases enormously whenever the resources for their computation is restricted in any effective manner at all. In particular, it is shown ...

In a networking environment, Quality-of-Service (QoS) routing plays an important role in the provision of real-time services with guaranteed throughput and bounded end-to-end delay. Its task is to nd a routing path which has su cient resources to support the requirements imposed by the applications. We propose several distributed algorithms for bandwidth-constrained routing and delay-constraine...

We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises the traces of the computation of the function. The structure of a prophecy is a possibly infinite tree, which is coerced by linearisation to a type of partial results defined by applying the delay monad to the co-domai...

The finite element computation of structures such as waveguides can lead to heavy computations when the length of the structure is large compared to the wavelength. Such waveguides can in fact be seen as one-dimensional periodic structures. In this paper a simple recursive method is presented to compute the global dynamic stiffness matrix of finite periodic structures. This allows to get freque...

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955] as an approach for investigating computation over the real numbers. It is based on enhancing the Turing machine model by introducing oracles that allow the machine to access finitary portions of the real infinite objects. Classes of computable real functions have been extensively studied as well ...

We derive recursive formulas for computing the state probabilities in priority queueing systems (preemptive and non-preemptive). The derivation is based only on the general structure of the generating function involved, and thus is simpler and more general than previous methods. We also discuss the applications of our method to other queueing systems.