Results 1  10
of
841,185
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
;belief revision") version, Weiss For the case of networks with multiple loops, Richard son To summarize, what is currently known about loopy propagation is that ( 1) it works very well in an error correcting code setting and (2) there are conditions for a singleloop network for which it can be guaranteed
Reevaluating Amdahl’s law
 Commun. ACM
, 1988
"... At Sandia National Laboratories, we are currently engaged in research involving massively parallel processing. There is considerable skepticism regarding the viability of massive parallelism; the skepticism centers around Amdahl’s law, an argument put forth by Gene Amda.hl in 1967 [l] that even w ..."
Abstract

Cited by 316 (4 self)
 Add to MetaCart
, then Amdahl’s law says that speedup is given by Speedup = (s + p)/(s + p/N) = l/b + p/N), where we have set total time s + p = 1 for algebraic simphcity. For N = 1024 this is an unforgivingly steep function of s near s = 0 (see Figure 1). The steepness of the graph near s = 0 (approximatelyN’) implies
Interactive Digital Photomontage
 ACM TRANS. GRAPH
, 2004
"... We describe an interactive, computerassisted framework for combining parts of a set of photographs into a single composite picture, a process we call "digital photomontage." Our framework makes use of two techniques primarily: graphcut optimization, to choose good seams within the consti ..."
Abstract

Cited by 304 (17 self)
 Add to MetaCart
We describe an interactive, computerassisted framework for combining parts of a set of photographs into a single composite picture, a process we call "digital photomontage." Our framework makes use of two techniques primarily: graphcut optimization, to choose good seams within
Approximating Maximum Independent Sets by Excluding Subgraphs
 BIT
, 1992
"... An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to O(n/(log n)²). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strong simultaneous performance guarantee ..."
Abstract

Cited by 141 (11 self)
 Add to MetaCart
An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to O(n/(log n)²). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strong simultaneous performance
An Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs *
"... Abstract Outerstring graphs are the intersection graphs of curves that lie inside a disk such that each curve intersects the boundary of the disk. Outerstring graphs are among the most general classes of intersection graphs studied. To date, no polynomial time algorithm is known for any of the clas ..."
Abstract
 Add to MetaCart
to the size of the graph. Given an outerstring graph and an intersection model consisting of polygonal arcs with a total of N segments, we develop an algorithm that solves the Maximum Weight Independent Set problem in O N 3 time. If the polygonal arcs are restricted to single segments, then outersegment
FDTD Analysis of Retinal Photoreceptor OuterSegment: Effect of Stacking NanoLayers of Membrane and Cytoplasm
"... This paper presents finitedifference timedomain (FDTD) analysis of the retinal photoreceptor outersegment. Our model simulates, in an optical sense, the reaction of the photoreceptor to the visible light spectrum. We consider a broadband pulse excitation to examine the mode coupling. Our investig ..."
Abstract
 Add to MetaCart
This paper presents finitedifference timedomain (FDTD) analysis of the retinal photoreceptor outersegment. Our model simulates, in an optical sense, the reaction of the photoreceptor to the visible light spectrum. We consider a broadband pulse excitation to examine the mode coupling. Our
Finding Maximum Independent Sets in Sparse and General Graphs
, 1999
"... a fvg); fvg [ SparseFindMIS(G \Gamma fvg \Gamma N(v))) end Figure 1: An algorithm that runs in time 2 0:114e on eedge graphs function FindMIS(G) begin if G contains at most 5n=2 edges then return SparseFindMIS(G) if G contains an edge fu; vg such that N(u) ae N(v) [ fvg then return FindMI ..."
Abstract

Cited by 55 (1 self)
 Add to MetaCart
a fvg); fvg [ SparseFindMIS(G \Gamma fvg \Gamma N(v))) end Figure 1: An algorithm that runs in time 2 0:114e on eedge graphs function FindMIS(G) begin if G contains at most 5n=2 edges then return SparseFindMIS(G) if G contains an edge fu; vg such that N(u) ae N(v) [ fvg then return Find
On Counting Independent Sets in Sparse Graphs
, 1998
"... We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree \Delta. The first implies that the Monte Carlo Markov chain technique is likely to fail if \Delta 6. The second shows that no fully polynomial randomized approximation scheme can exist if ..."
Abstract

Cited by 84 (13 self)
 Add to MetaCart
We prove two results concerning approximate counting of independent sets in graphs with constant maximum degree \Delta. The first implies that the Monte Carlo Markov chain technique is likely to fail if \Delta 6. The second shows that no fully polynomial randomized approximation scheme can exist
The number of maximum independent sets in graphs
 Taiwanese J. Math
, 2000
"... Abstract. In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including general graphs, trees, forests, (connected) graphs with at most one cycle, connected graphs ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including general graphs, trees, forests, (connected) graphs with at most one cycle, connected graphs
THE STRUCTURE OF MAXIMUM INDEPENDENT SETS IN FULLERENES
"... Abstract. A fullerene is a trivalent (valency three), convex polyhedron with only convex pentagonal and convex hexagonal faces. The graph theoretic independence number of fullerenes may be a useful predictor for stability in chemistry. We explore the independence number of fullerenes by exploring t ..."
Abstract
 Add to MetaCart
the structure of two maximum independent sets and an independent edge set. We will see that certain pairings of pentagons result in maximum independent sets, and that these pairings can be used to compute the independence number of icosahedral fullerenes.
Results 1  10
of
841,185