Results 1  10
of
468
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
and ap proximately 4000 findin nodes, with a number of ob served findings that varies per case. Due to the form of the noisyor CPTs the complexity of inference is ex ponential in the number of positive findings Results Initial experiments The experimental protocol for the PYRAMID network was as follows
Minimizing the Area for Planar StraightLine Grid Drawings
, 2007
"... The problem of finding straightline drawings for planar graphs with small area is an important aspect in the context of drawing planar graphs and it has been extensively studied. In this thesis we will study the problem of finding planar straightline grid drawings with minimum area. Our contribut ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The problem of finding straightline drawings for planar graphs with small area is an important aspect in the context of drawing planar graphs and it has been extensively studied. In this thesis we will study the problem of finding planar straightline grid drawings with minimum area. Our
3D straightline drawings of ktrees
, 2003
"... This paper studies the problem of computing 3D crossingfree straightline grid drawings of graphssuch that the overall volume is small. We show that every 2tree (and therefore every seriesparallel graph) can be drawn on an integer 3D grid consisting of 15 parallel lines and having linear volume. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper studies the problem of computing 3D crossingfree straightline grid drawings of graphssuch that the overall volume is small. We show that every 2tree (and therefore every seriesparallel graph) can be drawn on an integer 3D grid consisting of 15 parallel lines and having linear volume
Behavioral theories and the neurophysiology of reward,
 Annu. Rev. Psychol.
, 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
directed approach behavior, and decision making under uncertainty. Individual neurons can be studied in the reward systems of the brain, including dopamine neurons, orbitofrontal cortex, and striatum. The neural activity can be related to basic theoretical terms of reward and uncertainty, such as contiguity
Drawing Planar Partitions I: LLDrawings and LHDrawings
, 1998
"... Let a planar graph G = (V; E) and a partition V = A[B of the vertices be given. Can we draw G without edge crossings such that the partition is clearly visible? Such drawings aid to display partitions and cuts as they arise in various applications. In this paper, we first review a number of mode ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
of models of displaying the partition. Studying two of these models in detail, we provide necessary and sufficient conditions for the existence of a straightline planar drawing, and algorithms to create such drawings, if possible, with area O(n²).
Computing Radial Drawings . . .
, 2005
"... A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings of planar graphs by using the minimum number of concentric circles. We assume that the edges are drawn as straightline se ..."
Abstract
 Add to MetaCart
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings of planar graphs by using the minimum number of concentric circles. We assume that the edges are drawn as straightline
Monotone Drawings of Graphs
, 2012
"... We study a new standard for visualizing graphs: A monotone drawing is a straightline drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We study a new standard for visualizing graphs: A monotone drawing is a straightline drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected
Approximate Proximity Drawings
, 2012
"... We introduce and study a generalization of the wellknown region of influence proximity drawings, called (ε1, ε2)proximity drawings. Intuitively, given a definition of proximity and two real numbers ε1 ≥ 0 and ε2 ≥ 0, an (ε1, ε2)proximity drawing of a graph is a planar straightline drawing Γ such ..."
Abstract
 Add to MetaCart
We introduce and study a generalization of the wellknown region of influence proximity drawings, called (ε1, ε2)proximity drawings. Intuitively, given a definition of proximity and two real numbers ε1 ≥ 0 and ε2 ≥ 0, an (ε1, ε2)proximity drawing of a graph is a planar straightline drawing Γ
Really straight graph drawings
 Proc. 12th International Symp. on Graph Drawing (GD ’04
, 2004
"... We study straightline drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2trees, and planar 3trees. We prove that every 3connected plane graph on n vertices has a plane drawing with at most 5n/2 segme ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We study straightline drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2trees, and planar 3trees. We prove that every 3connected plane graph on n vertices has a plane drawing with at most 5n/2
Drawings of Nonplanar Graphs with Crossingfree Subgraphs
, 2013
"... We initiate the study of the following problem: Given a nonplanar graph G and a planar subgraph S of G, does there exist a straightline drawing Γ of G in the plane such that the edges of S are not crossed in Γ? We give positive and negative results for different kinds of spanning subgraphs S of G ..."
Abstract
 Add to MetaCart
We initiate the study of the following problem: Given a nonplanar graph G and a planar subgraph S of G, does there exist a straightline drawing Γ of G in the plane such that the edges of S are not crossed in Γ? We give positive and negative results for different kinds of spanning subgraphs
Results 1  10
of
468