Results 1  10
of
1,142
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based
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
modification to the update rules in that we normalized both ..\ and 1r messages at each iteration. As Pearl Nodes were updated in parallel: at each iteration all nodes calculated their outgoing messages based on the incoming messages of their neighbors from the pre vious iteration. The messages were said
Diversified topk graph pattern matching
 PVLDB
"... Graph pattern matching has been widely used in e.g., social data analysis. A number of matching algorithms have been developed that, given a graph pattern Q and a graph G, compute the set M(Q;G) of matches of Q in G. However, these algorithms often return an excessive number of matches, and are ex ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
, and are expensive on large reallife social graphs. Moreover, in practice many social queries are to find matches of a specific pattern node, rather than the entire M(Q;G). This paper studies topk graph pattern matching. (1) We revise graph pattern matching defined in terms of simulation, by supporting a
Optimal Enumeration: Efficient Topk Tree Matching
"... Driven by many real applications, graph pattern matching has attracted a great deal of attention recently. Consider that a twigpattern matching may result in an extremely large number of matches in a graph; this may not only confuse users by providing too many results but also lead to high computa ..."
Abstract
 Add to MetaCart
computational costs. In this paper, we study the problem of topk tree pattern matching; that is, given a rooted tree T, compute its topk matches in a directed graph G based on the twigpattern matching semantics. We firstly present a novel and optimal enumeration paradigm based on the principle of Lawler’s
Optimal Enumeration: Efficient Topk Tree Matching
"... Driven by many real applications, graph pattern matching has attracted a great deal of attention recently. Consider that a twigpattern matching may result in an extremely large number of matches in a graph; this may not only confuse users by providing too many results but also lead to high computa ..."
Abstract
 Add to MetaCart
computational costs. In this paper, we study the problem of topk tree pattern matching; that is, given a rooted tree T, compute its topk matches in a directed graph G based on the twigpattern matching semantics. We firstly present a novel and optimal enumeration paradigm based on the principle of Lawler’s
Fast linear iterations for distributed averaging.
 Systems & Control Letters,
, 2004
"... Abstract We consider the problem of finding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of finding the fastest converging ..."
Abstract

Cited by 433 (12 self)
 Add to MetaCart
converging linear iteration can be cast as a semidefinite program, and therefore efficiently and globally solved. These optimal linear iterations are often substantially faster than several common heuristics that are based on the Laplacian of the associated graph. We show how problem structure can
TopK Nearest Keyword Search on Large Graphs
"... It is quite common for networks emerging nowadays to have labels or textual contents on the nodes. On such networks, we study the problem of topk nearest keyword (kNK) search. In a network G modeled as an undirected graph, each node is attached with zero or more keywords, and each edge is assigned ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
It is quite common for networks emerging nowadays to have labels or textual contents on the nodes. On such networks, we study the problem of topk nearest keyword (kNK) search. In a network G modeled as an undirected graph, each node is attached with zero or more keywords, and each edge
TopK Subgraph Matching Query in A Large Graph
"... Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Subgraph search is defined as follows: given a query graph Q, we report all data graphs containing Q in the database. However, there is little work about subgraph searc ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
search in a single large graph, which has been used in many applications, such as biological network and social network. In this paper, we address topk subgraph matching query problem, which is defined as follows: given a query graph Q, we locate topk matchings of Q in a large data graph G according
A Graph Method for Keywordbased Selection of the topK Databases
"... While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to perform effective retrieval. Since these requirements pose a problem to lay or occasional users, several methods incorpo ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
and querying over multiple DMBSs. In order to avoid the high cost of searching in numerous, potentially irrelevant, databases in such systems, we propose GKS, a novel method for selecting the topK candidates based on their potential to contain results for a given query. GKS summarizes each database by a
Efficient TopK SimRankbased Similarity Join
"... SimRank is a popular and widelyadopted similarity measure to evaluate the similarity between nodes in a graph. It is time and space consuming to compute the SimRank similarities for all pairs of nodes, especially for large graphs. In realworld applications, users are only interested in the most s ..."
Abstract
 Add to MetaCart
graphs, exact algorithms cannot meet the highperformance requirement, and we also devise an approximate algorithm which can efficiently identify topk similar pairs under userspecified accuracy requirement. Experiments on both real and synthetic datasets show our method achieves high performance
Results 1  10
of
1,142