Results 1  10
of
2,188
Root Node
, 1992
"... In this thesis, I focus on the phonological representation of the articulatory component of speech producti"o. I argue for a phonological constituent called the Constriction Node, which represents the constriction gesture. Within the segmental tre9 (cf. Clements (1985), Sagay (1986». the Const ..."
Abstract
 Add to MetaCart
». the Constriction Node is a daughter of the Root Node (in the sense of the Clemenis/Sagey model). It itself dominates the Site. which correspof)~c; to the constriction location, and the Articulator. which corresponds to the organ executing the constriction gesture. The model of s~gment representation which includes
On Rooted NodeConnectivity Problems
, 1999
"... Let G be a graph which is koutconnected from a specified root node r, that is, G has k openly disjoint paths between r and v for every node v. We give necessary and sufficient conditions for the existence of a pair rv; rw of edges for which replacing these edges by a new edge vw gives a graph th ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Let G be a graph which is koutconnected from a specified root node r, that is, G has k openly disjoint paths between r and v for every node v. We give necessary and sufficient conditions for the existence of a pair rv; rw of edges for which replacing these edges by a new edge vw gives a graph
Choosing the root node of a quadtree
"... Abstract—Granular computing is closely related to the depth of the detail of information with which we are presented, or choose to process. In spatial cognition and image processing such detail is given by the resolution of a picture. The quadtree representation of an image offers a quick look at th ..."
Abstract
 Add to MetaCart
at the image at various stages of granularity, and successive quadtree representations can be used to represent change. In this paper we present a heuristic algorithm to find a root node of a region quadtree which reduces the number of leaves when compared with the standard quadtree decomposition. I.
Hop Constrained Steiner Trees with multiple Root Nodes
, 2013
"... We consider a network design problem that generalizes the hop and diameter constrained Steiner tree problem as follows: Given an edgeweighted undirected graph with two disjoint subsets representing roots and terminals, find a minimumweight subtree that spans all the roots and terminals so that the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
that the number of hops between each relevant node and an arbitrary root does not exceed a given hop limit H. The set of relevant nodes may be equal to the set of terminals, or to the union of terminals and root nodes. This article proposes integer linear programming models utilizing one layered graph for each
Bayeux: An architecture for scalable and faulttolerant widearea data dissemination
, 2001
"... The demand for streaming multimedia applications is growing at an incredible rate. In this paper, we propose Bayeux, an efficient applicationlevel multicast system that scales to arbitrarily large receiver groups while tolerating failures in routers and network links. Bayeux also includes specific ..."
Abstract

Cited by 465 (12 self)
 Add to MetaCart
mechanisms for loadbalancing across replicate root nodes and more efficient bandwidth consumption. Our simulation results indicate that Bayeux maintains these properties while keeping transmission overhead low. To achieve these properties, Bayeux leverages the architecture of Tapestry, a fault
X.: Tracking 3D human pose with large root node uncertainty
 In: CVPR. (2011
"... Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of the object. In this work a method is presented to robustly track 3D human pose by permitting greater uncertainty to be m ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of the object. In this work a method is presented to robustly track 3D human pose by permitting greater uncertainty
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
; state of the root nodes to 0.9, and we utilized the noisyOR model for the other nodes with a small (0.1) inhibition probability (apart from the leak term, which we inhibited with probability 0.9). This param eterization has the effect of propagating 1 's from the top layer to the bottom. Thus
Myrinet: A GigabitperSecond Local Area Network
 IEEE Micro
, 1995
"... Abstract. Myrinet is a new type of localarea network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP messagepassing network that can span campus dimensions, rather than as a widea ..."
Abstract

Cited by 1011 (0 self)
 Add to MetaCart
such as Ethernet and FDDI, it is helpful to start with Myrinet's genealogy. Myrinet is rooted in the results of two ARPAsponsored research projects, the Caltech Mosaic, an experimental, finegrain multicomputer [1], and the USC Information Sciences Institute (USC/ISI) ATOMIC LAN [2, 3], which was built using
XORs in the air: practical wireless network coding
 In Proc. ACM SIGCOMM
, 2006
"... This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our de ..."
Abstract

Cited by 548 (20 self)
 Add to MetaCart
design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing
Root Node Vaccines for Bayesian Network Structure Learning based on Immune Algorithm
"... Abstract. To facilitate the application of Bayesian network in engineering fields, learning proper structure from dataset is one of the most efficiency Bayesian network modeling technique. In this paper, the description and characteristics of Bayesian networks and immune algorithms are discussed at ..."
Abstract
 Add to MetaCart
at first. Then, the extraction method of root node vaccines is proposed to accelerate the model structure learning process. Thirdly, the immune algorithm based method is also applied to search the best Bayesian network structure. Finally, the simulation studies based on a car start BN model are carried out
Results 1  10
of
2,188