Results 1  10
of
803
The University of Florida sparse matrix collection
 NA DIGEST
, 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract

Cited by 536 (17 self)
 Add to MetaCart
and graphs, economic and financial modeling, theoretical and quantum chemistry, chemical process simulation, mathematics and statistics, and power networks). The collection meets a vital need that artificiallygenerated matrices cannot meet, and is widely used by the sparse matrix algorithms community
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
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
Scalefree characteristics of random networks: The topology of the worldwide web
 PHYSICA A
, 2000
"... The worldwide web forms a large directed graph, whose vertices are documents and edges are links pointing from one document to another. Here we demonstrate that despite its apparent random character, the topology of this graph has a number of universal scalefree characteristics. We introduce a mod ..."
Abstract

Cited by 350 (0 self)
 Add to MetaCart
The worldwide web forms a large directed graph, whose vertices are documents and edges are links pointing from one document to another. Here we demonstrate that despite its apparent random character, the topology of this graph has a number of universal scalefree characteristics. We introduce a
Analysis and Visualization of Network Data using JUNG
"... The JUNG (Java Universal Network/Graph) Framework is a free, opensource software library that provides a common and extendible language for the manipulation, analysis, and visualization of data that can be represented as a graph or network. It is written in the Java programming language, allowing J ..."
Abstract

Cited by 86 (0 self)
 Add to MetaCart
The JUNG (Java Universal Network/Graph) Framework is a free, opensource software library that provides a common and extendible language for the manipulation, analysis, and visualization of data that can be represented as a graph or network. It is written in the Java programming language, allowing
Analysis and Visualization of Network Data Using JUNG
"... ABSTRACT The JUNG (Java Universal Network/Graph) Framework is a free, opensource software library that provides a common and extendible language for the manipulation, analysis, and visualization of data that can be represented as a graph or network. It is written in the Java programming language, ..."
Abstract
 Add to MetaCart
ABSTRACT The JUNG (Java Universal Network/Graph) Framework is a free, opensource software library that provides a common and extendible language for the manipulation, analysis, and visualization of data that can be represented as a graph or network. It is written in the Java programming language
Querying the World Wide Web
, 1997
"... The World Wide Web is a large, heterogeneous, distributed collection of documents connected by hypertext links. The most common technology currently used for searching the Web depends on sending information retrieval requests to "index servers" that index as many documents as they can find ..."
Abstract

Cited by 257 (14 self)
 Add to MetaCart
formal semantics for WebSQL using a calculus based on a novel "virtual graph" model of a document network. We propose a new theory of query cost based on the idea of "query locality," that is, how much of the network must be visited to answer a particular query. We give an algorithm
A graphbased system for networkvulnerability analysis
 in Proceedings of the 1998 workshop on New security paradigms
, 1998
"... caphill @ sandia..qov This paper presents a graphbased approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences follow ..."
Abstract

Cited by 168 (0 self)
 Add to MetaCart
caphill @ sandia..qov This paper presents a graphbased approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences
An Approximate MaxFlow MinCut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
, 1989
"... In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th9 ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
can prove that any nnode bounded degree graph, G, with minimum edge expansion h can be configured offline to simulate any nnode bounded degree graph H in 0(log n/a)steps using constant size queues. By letting H be a universal network, we can then use G to simulate a PRAM online with elay 0(log2 n1
A Framework For Solving Vlsi Graph Layout Problems
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1984
"... This paper introduces a new divideandconquer framework for VLSI graph layout. Universally close upper and lower bounds are obtained for important cost functions such as layout area and propagation delay. The framework is also effectively used to design regular and configurable layouts, to assemble ..."
Abstract

Cited by 164 (4 self)
 Add to MetaCart
This paper introduces a new divideandconquer framework for VLSI graph layout. Universally close upper and lower bounds are obtained for important cost functions such as layout area and propagation delay. The framework is also effectively used to design regular and configurable layouts
Qualitative Simulation of Genetic Regulatory Networks Using PiecewiseLinear Models
, 2001
"... In order to cope with the large amounts of data that have become available in genomics, mathematical tools for the analysis of networks of interactions between genes, proteins, and other molecules are indispensable. We present a method for the qualitative simulation of genetic regulatory networks ..."
Abstract

Cited by 190 (30 self)
 Add to MetaCart
regulatory networks. Given a qualitative model of a genetic regulatory network, consisting of a system of PL differential equations and inequality constraints on the parameter values, the method produces a graph of qualitative states and transitions between qualitative states, summarizing the qualitative
Results 1  10
of
803