Results 1 
7 of
7
Extending Greedy Multicast Routing to Delay Sensitive Applications
, 1999
"... Given a weighted undirected graph G(V; E) and a subset R of V , a Steiner tree is a subtree of G that contains each vertex in R. In this paper, we present an online algorithm for nding a Steiner tree that simultaneously approximates the shortest path tree and the minimum weight Steiner tree, when ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
, when the vertices in the set R are revealed in an online fashion. This problem arises naturally while trying to construct sourcebased multicast trees of low cost and good delay. The cost of the tree we construct is within an O(log jRj) factor of the optimal cost, and the path length from the root
An Efficient PermutationBased Parallel Algorithm for RangeJoin in Hypercubes
 Griffith University
, 1993
"... The rangejoin of sets R and S is defined to be the set containing all tuples (r; s) that satisfy e 1 jr \Gamma sj e 2 , where r 2 R, s 2 S, e 1 and e 2 are fixed constants. This paper proposes an efficient parallel rangejoin algorithm in hypercubes. To compute the rangejoin of two sets R and S ..."
Abstract

Cited by 10 (10 self)
 Add to MetaCart
and S on a hypercube of p processors (p jRj = m jSj = n), the proposed algorithm simply permutes the elements of R to obtain their possible combinations with the elements S and thus all possible local rangejoins. Requiring only O( m+n p ) local memory at each processor, our algorithm has a time
SelectionBased Parallel RangeJoin in Hypercubes
 Griffith University
, 1993
"... In this paper we propose a new parallel algorithm for computing the rangejoin of two sets R and S, i.e., the set containing all tuples (r, s), r 2 R and s 2 S, such that e 1 jr \Gamma sj e 2 , in a hypercube computer with p processors, where 0 e 1 e 2 are constants and 1 p jRj = m jSj = n. O ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
In this paper we propose a new parallel algorithm for computing the rangejoin of two sets R and S, i.e., the set containing all tuples (r, s), r 2 R and s 2 S, such that e 1 jr \Gamma sj e 2 , in a hypercube computer with p processors, where 0 e 1 e 2 are constants and 1 p jRj = m jSj = n
Corrections To The Critical Temperature In 2D Ising Systems With Kac Potentials
, 1995
"... . We consider a d = 2 Ising system with a Kac potential whose mean field critical temperature is 1. Calling fl ? 0 the Kac parameter, we prove that there exists c ? ? 0 so that the true inverse critical temperature fi cr (fl) ? 1 + bfl 2 log fl \Gamma1 , for any b ! c ? and fl correspondingl ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
. We consider a d = 2 Ising system with a Kac potential whose mean field critical temperature is 1. Calling fl ? 0 the Kac parameter, we prove that there exists c ? ? 0 so that the true inverse critical temperature fi cr (fl) ? 1 + bfl 2 log fl \Gamma1 , for any b ! c ? and fl
Maximal Antichain Lattice Algorithms for Distributed Computations
"... Abstract. The lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining signific ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
in the computation, and m is the size of the lattice of maximal antichains. The algorithm by Jourdan, Rampon and Jard [JRJ94] takes O((n + w 2)wm) time where w is the width of the computation. All these algorithms assume as input the lattice of maximal antichains prior to the arrival of a new event. We present a new
École Doctorale de Physique de la Région Parisienne ED 107 Thèse de doctorat
"... Sujet de la thèse: Dynamique quantique horséquilibre et systèmes désordonnés pour des atomes ultrafroids bosoniques présentée par Bruno Sciolla pour obtenir le grade de Docteur de l’Université Parissud 11 Directeur de thèse: Henri Orland Thèse préparée sous la direction de Giulio Biroli ..."
Abstract
 Add to MetaCart
Sujet de la thèse: Dynamique quantique horséquilibre et systèmes désordonnés pour des atomes ultrafroids bosoniques présentée par Bruno Sciolla pour obtenir le grade de Docteur de l’Université Parissud 11 Directeur de thèse: Henri Orland Thèse préparée sous la direction de Giulio Biroli