Results 1  10
of
23
N.: A GraphTheoretical Notation for the Construction of LSP Hierarchies
 In: 15 th ITC Specialist Seminar
, 2002
"... To achieve scalability for reservations in packet switched networks, the concept of tunnel and funnel aggregation is used. They are both supported in the data forwarding plane of Multiprotocol Label Switching (MPLS) by label switched paths (LSPs). We propose the recursive application of tunnels and ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
and funnels that leads to an LSP hierarchy which yields more scalable reservation structures. We propose a graph theoretical notation for tunnels, funnels, and the recursive application of these concepts. Valid aggregation scenarios are described by constraints in the hierarchy graph. A cost function assesses
Graph Notation for Arrays
, 2000
"... A graphtheoretical notation for array concatenation represents arrays as bubbles with arms sticking out, each arm with a specified number of “fingers. ” Bubbles with one arm are vectors, with two arms matrices, etc. Arrays can only hold hands, i.e., “contract ” along a given pair of arms, if the ..."
Abstract
 Add to MetaCart
A graphtheoretical notation for array concatenation represents arrays as bubbles with arms sticking out, each arm with a specified number of “fingers. ” Bubbles with one arm are vectors, with two arms matrices, etc. Arrays can only hold hands, i.e., “contract ” along a given pair of arms
Attributed Tree Homomorphism Using Association Graphs
 In Proc. IEEE Int. Conf. on Pattern Recognition
, 2000
"... .... 1 Introduction 2 Tree homomorphisms and maximal cliques 2.1 Notations and definitions Before going into the details of the proposed framework, we need to introduce some graphtheoretical notations and definitions. More details can be found in standard textbooks of graph theory, such as [8]. Le ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
.... 1 Introduction 2 Tree homomorphisms and maximal cliques 2.1 Notations and definitions Before going into the details of the proposed framework, we need to introduce some graphtheoretical notations and definitions. More details can be found in standard textbooks of graph theory, such as [8
Understanding Ontologies in Scholarly Disciplines
"... Description logics are valuable for modeling the conceptual structures of scientific and engineering research because the underlying ontologies generally have a taxonomic core. Such structures have natural representations through semantic networks that mirror the underlying description logic grapht ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Description logics are valuable for modeling the conceptual structures of scientific and engineering research because the underlying ontologies generally have a taxonomic core. Such structures have natural representations through semantic networks that mirror the underlying description logic graphtheoretic
BIOINFORMATICS APPLICATIONS NOTE PTGL a webbased database application for protein topologies
"... Summary: PTGL (Protein Topology Graph Library) is a database application for the representation and retrieval of protein topologies. Protein topologies are based on a graphtheoretical protein model at secondary structure level. Different views on protein topology are given by four linear notations. ..."
Abstract
 Add to MetaCart
Summary: PTGL (Protein Topology Graph Library) is a database application for the representation and retrieval of protein topologies. Protein topologies are based on a graphtheoretical protein model at secondary structure level. Different views on protein topology are given by four linear notations
Closure Systems and their Structure
 Information Sciences
, 2000
"... this paper. In Section 1, we examine antimatroid closure spaces. In Section 2, we consider a closure operator that has been widely used in digital image processing [25]. This operator, which can be equally well defined on graphs, is not antimatroid; but it is shown in Section 3 that it retains many ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
many of the same structural properties, and is closely related to the classic graphtheoretic theme of domination. Finally, in Section 4, we relate these concepts to premise system[30]. 1 Antimatroid Closure Spaces Assume we have a closure operator ' satisfying the usual axioms: 8Y ` U (we let U
Diagramming Registration Connectivity and Structure
, 1995
"... . Computerassisted surgical systems must bring preoperative diagnostic images, surgical plans, patient anatomy, surgical tools, robots, and other components into accurate alignment with one another. Multistep registration procedures have been devised, which are difficult to analyze, or even to des ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to describe concisely. Here we introduce a notation for diagramming registration strategies and procedures, and apply it to a spectrum of current methods. The notation uses a graphtheoretic framework consisting of two elements: nodes, representing objects; and links, representing actions. Connectivity
PTGL—a webbased database application for protein topologies
, 2004
"... Summary: Protein Topology Graph Library (PTGL) is a database application for the representation and retrieval of protein topologies. Protein topologies are based on a graphtheoretical protein model at secondary structure level. Different views on protein topology are given by four linear notations ..."
Abstract
 Add to MetaCart
Summary: Protein Topology Graph Library (PTGL) is a database application for the representation and retrieval of protein topologies. Protein topologies are based on a graphtheoretical protein model at secondary structure level. Different views on protein topology are given by four linear
Diagramming Registration Connectivity and Structure
, 1995
"... Abstract. Computerassisted surgical systems must bring preoperative diagnostic images, surgical plans, patient anatomy, surgical tools, robots, and other components into accurate alignment with one another. Multistep registration procedures have been devised, which are difficult to analyze, or eve ..."
Abstract
 Add to MetaCart
, or even to describe concisely. Here we introduce a notation for diagramming registration strategies and procedures, and apply it to a spectrum of current methods. The notation uses a graphtheoretic framework consisting of two elements: nodes, representing objects; and links, representing actions
Using Graph Theory to Represent a SpatioTemporal RoleBased Access Control Model MANACHAI TOAHCHOODEE
"... Pervasive computing applications have unique characteristics that preclude the use of traditional access control models, such as RoleBased Access Control (RBAC), for their protection. Such models do not take into account contextual information before making access decisions and cannot handle the d ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
the dynamism inherent in pervasive computing applications. Towards this end, we propose new spatiotemporal access control models for use in such applications and formally define their semantics using graphtheoretic notation. The dynamism inherent in pervasive computing applications may cause the access
Results 1  10
of
23