Results 1  10
of
2,103,397
TwoConnected Steiner Networks: Structural Properties
, 2004
"... We consider the problem of constructing a minimumlength 2connected network for a set of terminals in a graph where edgeweights satisfy the triangle inequality. As a special case of the problem, we have the Euclidean 2connected Steiner network problem in which a set of points in the plane shou ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider the problem of constructing a minimumlength 2connected network for a set of terminals in a graph where edgeweights satisfy the triangle inequality. As a special case of the problem, we have the Euclidean 2connected Steiner network problem in which a set of points in the plane
Relay placement for twoconnectivity
, 2012
"... Motivated by applications to wireless sensor networks, we study the following problem. We are given a set S of wireless sensor nodes, given as a multiset of points in a normed space. We must place a minimumsize (multi)set Q of wireless relay nodes in the normed space such that the unitdisk graph i ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
approximation ratios of dMST for biconnectivity and 2dMST − 1 for twoedgeconnectivity respectively. To do so we prove additional structural properties regarding bypassing Steiner nodes in biconnected graphs.
Some Structural and Geometric Properties of TwoConnected Steiner Networks
"... We consider the problem of constructing a shortest Euclidean 2connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survivable communication networks. A SMN decomposes into components that are full Steiner trees. Winter and Zachariasen proved ..."
Abstract
 Add to MetaCart
We consider the problem of constructing a shortest Euclidean 2connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survivable communication networks. A SMN decomposes into components that are full Steiner trees. Winter and Zachariasen
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 500 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible
Fusion, Propagation, and Structuring in Belief Networks
 ARTIFICIAL INTELLIGENCE
, 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract

Cited by 482 (8 self)
 Add to MetaCart
with the task of fusing and propagating the impacts of new information through the networks in such a way that, when equilibrium is reached, each proposition will be assigned a measure of belief consistent with the axioms of probability theory. It is shown that if the network is singly connected (e.g. treestructured
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth maintenance, scheduling, spatiotemporal reasoning, logic programming and user interface. Constraint networks are graphical representations used to guide strategies for solving constraint satisfaction problems
Towards an Active Network Architecture
 Computer Communication Review
, 1996
"... Active networks allow their users to inject customized programs into the nodes of the network. An extreme case, in which we are most interested, replaces packets with "capsules"  program fragments that are executed at each network router/switch they traverse. Active architectures permit ..."
Abstract

Cited by 492 (7 self)
 Add to MetaCart
Active networks allow their users to inject customized programs into the nodes of the network. An extreme case, in which we are most interested, replaces packets with "capsules"  program fragments that are executed at each network router/switch they traverse. Active architectures permit
The LargeScale Organization of Metabolic Networks
, 2000
"... In a cell or microorganism the processes that generate mass, energy, information transfer, and cell fate specification are seamlessly integrated through a complex network of various cellular constituents and reactions. However, despite the key role these networks play in sustaining various cellular ..."
Abstract

Cited by 599 (7 self)
 Add to MetaCart
functions, their largescale structure is essentially unknown. Here we present the first systematic comparative mathematical analysis of the metabolic networks of 43 organisms representing all three domains of life. We show that, despite significant variances in their individual constituents and pathways
Application of Phylogenetic Networks in Evolutionary Studies
 SUBMITTED TO MBE 2005
, 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract

Cited by 867 (15 self)
 Add to MetaCart
evolution proceeds in a treelike manner, analysis of the data may not be best served by using methods that enforce a tree structure, but rather by a richer visualization of the data to evaluate its properties, at least as an essential first step. Thus, phylogenetic networks should be employed when
Overcast: Reliable Multicasting with an Overlay Network
, 2000
"... Overcast is an applicationlevel multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations in a ..."
Abstract

Cited by 563 (10 self)
 Add to MetaCart
Overcast is an applicationlevel multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations
Results 1  10
of
2,103,397