Results 1  10
of
698,123
Thickness of bar 1visibility graphs
 IN PROCEEDINGS OF GRAPH DRAWING ’06
, 2007
"... Bar kvisibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines of sight which can traverse up to k bars. These graphs were introduced by Dean et al. [3] who conjectured that bar 1vis ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Bar kvisibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines of sight which can traverse up to k bars. These graphs were introduced by Dean et al. [3] who conjectured that bar 1
Bar 1Visibility Graphs and their relation to other Nearly Planar Graphs?
"... Abstract. A graph is called a strong ( resp. weak) bar 1visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a thick vertical line connecting them that intersects at most o ..."
Abstract
 Add to MetaCart
Abstract. A graph is called a strong ( resp. weak) bar 1visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a thick vertical line connecting them that intersects at most
Bar kVisibility Graphs
"... Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a onetoone correspondence between vertices of G and bars in S, such that there is an edge between two vertices in G if and only if t ..."
Abstract
 Add to MetaCart
visibility graphs are planar, we seek measurements of closeness to planarity for bar kvisibility graphs. We obtain an upper bound on the number of edges in a bar kvisibility graph. As a consequence, we obtain an upper bound of 12 on the chromatic number of bar 1visibility graphs, and a tight upper bound
Automating the Design of Graphical Presentations of Relational Information
 ACM Transactions on Graphics
, 1986
"... The goal of the research described in this paper is to develop an applicationindependent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal: The codi ..."
Abstract

Cited by 559 (9 self)
 Add to MetaCart
The goal of the research described in this paper is to develop an applicationindependent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal
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 674 (15 self)
 Add to MetaCart
with loops (undirected cycles). The algorithm is an exact inference algorithm for singly connected networks the beliefs converge to the cor rect marginals in a number of iterations equal to the diameter of the graph.1 However, as Pearl noted, the same algorithm will not give the correct beliefs for mul
Bar kVisibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
"... Abstract. Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a onetoone correspondence between vertices of G and bars in S, such that there is an edge between two vertices in G if and ..."
Abstract
 Add to MetaCart
. Since all bar visibility graphs are planar, we seek measurements of closeness to planarity for bar kvisibility graphs. We obtain an upper bound on the number of edges in a bar kvisibility graph. As a consequence, we obtain an upper bound of 12 on the chromatic number of bar 1visibility graphs, and a
Ownership Types for Flexible Alias Protection
 In ObjectOriented Programming, Systems, Languages, and Applications (OOPSLA
, 1998
"... Objectoriented programming languages allow interobject aliasing. Although necessary to construct linked data structures and networks of interacting objects, aliasing is problematic in that an aggregate object's state can change via an alias to one of its components, without the aggregate bein ..."
Abstract

Cited by 365 (41 self)
 Add to MetaCart
to be sound, and the specific aliasing properties that a system's object graph satisfies are formulated and proven invariant for welltyped programs. Keywords Alias protection, sharing, containment, ownership, representation exposure, programming language design 1
Characterizations of 1,kbar visibility trees
 In preparation
, 2005
"... A unit barvisibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unitlength bars such that two vertices are adjacent if and only if there is a unobstructed, nondegenerate, vertical band of visibility between the corresponding bars. We generalize unit bar ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
barvisibility graphs to [1, k]barvisibility graphs by allowing the lengths of the bars to be between 1/k and 1. We completely characterize these graphs for trees. We establish an algorithm with complexity O(kn) to determine whether a tree with n vertices has a [1, k]barvisibility representation
A Comparison of Dynamic Branch Predictors that use Two Levels of Branch History
 in Proceedings of the 20th Annual International Symposium on Computer Architecture
, 1993
"... Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive dy ..."
Abstract

Cited by 279 (9 self)
 Add to MetaCart
Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive
1Visibility Representations of 1Planar Graphs
, 2014
"... A 1visibility representation of a graph displays each vertex as a horizontal vertexsegment, called a bar, and each edge as a vertical edgesegment between the segments of the vertices, such that each edgesegment crosses at most one vertexsegment and each vertexsegment is crossed by at most one ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A 1visibility representation of a graph displays each vertex as a horizontal vertexsegment, called a bar, and each edge as a vertical edgesegment between the segments of the vertices, such that each edgesegment crosses at most one vertexsegment and each vertexsegment is crossed by at most
Results 1  10
of
698,123