Results 1  10
of
131,056
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
limit performance of "Turbo Codes" codes whose decoding algorithm is equivalent to loopy belief propagation in a chainstructured Bayesian network. In this paper we ask: is there something spe cial about the errorcorrecting code context, or does loopy propagation work as an ap proximate inference scheme
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 366 (9 self)
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
ASKGraphView: A Large Scale Graph Visualization System
 IEEE Transactions on Visualization and Computer Graphics
, 2006
"... Abstract—We describe ASKGraphView, a nodelinkbased graph visualization system that allows clustering and interactive navigation of large graphs, ranging in size up to 16 million edges. The system uses a scalable architecture and a series of increasingly sophisticated clustering algorithms to cons ..."
Abstract

Cited by 77 (0 self)
 Add to MetaCart
Abstract—We describe ASKGraphView, a nodelinkbased graph visualization system that allows clustering and interactive navigation of large graphs, ranging in size up to 16 million edges. The system uses a scalable architecture and a series of increasingly sophisticated clustering algorithms
Towards identity anonymization on graphs
 In Proceedings of ACM SIGMOD
, 2008
"... The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities of the nodes before publishing the graph/social network data does not guarantee privacy. The structure of the graph itsel ..."
Abstract

Cited by 123 (6 self)
 Add to MetaCart
as v. This definition of anonymity prevents the reidentification of individuals by adversaries with a priori knowledge of the degree of certain nodes. We formally define the graphanonymization problem that, given a graph G, asks for the kdegree anonymous graph that stems from G with the minimum
The Complexity of Multiterminal Cuts
 SIAM Journal on Computing
, 1994
"... In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem, and ..."
Abstract

Cited by 194 (0 self)
 Add to MetaCart
In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem
Graphs
"... • So far, we have only considered sets of items that are related to each other through some kind of ordering (if at all). • In other words, two items x and y are only related by their relative positions in the ordered list. • We will now generalize this idea by considering additional connectivity re ..."
Abstract
 Add to MetaCart
relationships between items. • To do so, we will specify that there is a direct link between certain pairs of items. • This will allow us to ask questions such as 2
Humanassisted graph search: It’s okay to ask questions
 Stanford Infolab
"... We consider the problem of humanassisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by asking an omniscient human questions of the form “Is there a target node that is reachable from the current node?”. This ..."
Abstract

Cited by 38 (8 self)
 Add to MetaCart
We consider the problem of humanassisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by asking an omniscient human questions of the form “Is there a target node that is reachable from the current node
Results 1  10
of
131,056