Results 1  10
of
352,916
Tree Edges
"... GOAL: Propose an ecient and exact inference algorithm based on branchandbound (BB) to solve the human pose estimation problem on loopy graphical models Motivation: Cast human pose estimation problem as MAPMRFs inference problem Solving MAP inference on general MRFs is challenging Pros: ecient ..."
Abstract
 Add to MetaCart
GOAL: Propose an ecient and exact inference algorithm based on branchandbound (BB) to solve the human pose estimation problem on loopy graphical models Motivation: Cast human pose estimation problem as MAPMRFs inference problem Solving MAP inference on general MRFs is challenging Pros: ecient inference by dynamic programming ( ). Cons: approximated model; common misclassication errors. Pros: more interactions between parts. Cons: exact inference NPhard; require approximated inference [1] or reduced state space. Contributions: Solve loopy models with large # of part hypotheses exactly. Eciency is provably guaranteed when # of nodes is small. Up to 74 times faster than competing techniques [2]! Enable more accurate results than nonloopy models [3]! Key Intuitions: Flexible bound by relaxing the loopy model into a mixture of star models. Novel data structure (BMT) and an ecient search routine (OBMS) to signicantly reduce the time complexity for calculating the bound in each branch of the BB search Given the model ,∑∑ εij ji p ij
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 432 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
Tree edge decomposition with an application to minimum ultrametric tree . . .
 J COMB OPTIM
, 2006
"... ..."
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 733 (18 self)
 Add to MetaCart
time and all other standard heap operations in o ( 1) amortized time. Using Fheaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worstcase bounds, where n is the number of vertices and m the number of edges
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 663 (33 self)
 Add to MetaCart
to be shortest paths. The algorithm and its analysis are simple and intuitive, yet the algorithm runs as fast as any other known method on dense. graphs, achieving an O(n³) time bound on an nvertex graph. By incorporating the dynamic tree data structure of Sleator and Tarjan, we obtain a version
Are You Sure? Confidence in Prediction of Dependency Tree Edges
"... We describe and evaluate several methods for estimating the confidence in the peredge correctness of a predicted dependency parse. We show empirically that the confidence is associated with the probability that an edge is selected correctly and that it can be used to detect incorrect edges very eff ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We describe and evaluate several methods for estimating the confidence in the peredge correctness of a predicted dependency parse. We show empirically that the confidence is associated with the probability that an edge is selected correctly and that it can be used to detect incorrect edges very
A Scalable, Commodity Data Center Network Architecture
, 2008
"... Today’s data centers may contain tens of thousands of computers with significant aggregate bandwidth requirements. The network architecture typically consists of a tree of routing and switching elements with progressively more specialized and expensive equipment moving up the network hierarchy. Unfo ..."
Abstract

Cited by 436 (17 self)
 Add to MetaCart
Today’s data centers may contain tens of thousands of computers with significant aggregate bandwidth requirements. The network architecture typically consists of a tree of routing and switching elements with progressively more specialized and expensive equipment moving up the network hierarchy
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract

Cited by 343 (21 self)
 Add to MetaCart
A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n
A Query Language and Optimization Techniques for Unstructured Data
, 1996
"... A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in treelike structures whose components can be used ..."
Abstract

Cited by 404 (35 self)
 Add to MetaCart
A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in treelike structures whose components can be used
Results 1  10
of
352,916