Results 21  30
of
109
An Autonomous and Decentralized Protocol for Delay Sensitive Overlay Multicast Tree
 Proc. of ICDCS’04
, 2004
"... In this paper, we present a protocol for dynamically maintaining a degreebounded delay sensitive spanning tree in a decentralized way on overlay networks. The protocol aims at repairing the spanning tree autonomously even if multiple nodes ’ leave operations or failures (disappearances) occur simul ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we present a protocol for dynamically maintaining a degreebounded delay sensitive spanning tree in a decentralized way on overlay networks. The protocol aims at repairing the spanning tree autonomously even if multiple nodes ’ leave operations or failures (disappearances) occur simultaneously or continuously in a specified period. It also aims at maintaining the diameter (maximum delay) of the tree as small as possible. The simulation results using ns2 have shown that the protocol could keep reasonable diameters compared with the existing centralized static algorithm even if many nodes ’ participations and disappearances occur frequently. 1
Two Linear Time Algorithms for MST on Minor Closed Graph Classes
, 2002
"... This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in O(V + E) time for any proper class of graphs closed on graph minors, which includes planar graphs and graphs of bounded genus. Both algorithms require no a priori knowledge of the structure of th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in O(V + E) time for any proper class of graphs closed on graph minors, which includes planar graphs and graphs of bounded genus. Both algorithms require no a priori knowledge of the structure of the class except for its density; edge weights are only compared and no random access to data is needed.
Excavator: a computer program for efficiently mining gene expression data
 Nucleic Acids Research
, 2003
"... Massive geneexpression data are generated using microarrays, and clustering geneexpression data is useful for studying functional relationship among genes in a biological process. We have developed a computer package, EXCAVATOR ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Massive geneexpression data are generated using microarrays, and clustering geneexpression data is useful for studying functional relationship among genes in a biological process. We have developed a computer package, EXCAVATOR
The Diameter of the Minimum Spanning Tree of a Complete Graph
"... } be independent identically distributed weights for the edges of Kn. If Xi � = Xj for i � = j, then ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
} be independent identically distributed weights for the edges of Kn. If Xi � = Xj for i � = j, then
A Few Remarks On The History Of MSTProblem
, 1997
"... On the background of Boruvka's pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper GrahamHell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
On the background of Boruvka's pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper GrahamHell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem.
D.: On minimum and maximumweight minimum spanning trees with neighborhoods
, 2012
"... Abstract. We study optimization problems for the Euclidean minimum spanning tree (MST) on imprecise data. To model imprecision, we accept a set of disjoint disks in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We study optimization problems for the Euclidean minimum spanning tree (MST) on imprecise data. To model imprecision, we accept a set of disjoint disks in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points. We consider both minimizing and maximizing the weight of the MST over the input. The minimum weight version of the problem is known as the minimum spanning tree with neighborhoods (MSTN) problem, and the maximum weight version (maxMSTN) has not been studied previously to our knowledge. We provide deterministic and parameterized approximation algorithms for the maxMSTN problem, and a parameterized algorithm for the MSTN problem. Additionally, we present hardness of approximation proofs for both settings. 1
Models for Connected Networks over Random Points and a RouteLength Statistic
, 2009
"... We review mathematically tractable models for connected networks on random points in the plane, emphasising the littlestudied class of proximity graphs and introducing a new model called the Hammersley network. We introduce and motivate a particular statistic R measuring shortness of routes in a ne ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
We review mathematically tractable models for connected networks on random points in the plane, emphasising the littlestudied class of proximity graphs and introducing a new model called the Hammersley network. We introduce and motivate a particular statistic R measuring shortness of routes in a network. We show (via Monte Carlo, in part) the tradeoff between normalized network length and R in a oneparameter family of proximity graphs. How close this family comes to the optimal tradeoff over all possible networks remains an intriguing open question. This material has been presented in talks since 2007. It will be periodically updated as technical papers [3, 4, 7, 8] are completed, and ultimately published as some kind of survey.
Initialization free graph based clustering
 Laboratoire I3S, CNRS, Universitè de NiceSophia Antipolis
, 2009
"... ..."
(Show Context)