This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored constraints of the MST algorithm significantly inhibit parsing accuracy, we show that generating the 50-best parses according to an edge-factored model has an oracle performance well above the 1-best performance of the ...

Consider a complete graph Kn where the edges have costs given by independent random variables, each distributed uniformly between 0 and 1. The cost of the minimum spanning tree in this graph is a random variable which has been the subject of much study. This note considers the large deviation probability of this random variable. Previous work has shown that the log-probability of deviation by ε...

Previous studies has shown that for a weighted undirected graph having n vertices and m edges, a minimal weight spanning tree can be found with O (√ mn ) calls to the weight oracle. The present note shows that a given spanning tree can be verified to be a minimal weight spanning tree with only O (

This paper develops a new distribution-free multivariate procedure for statistical process control based on minimal spanning tree (MST), which integrates a multivariate two-sample goodness-of-fit (GOF) test based on MST and change-point model. Simulation results show that our proposed procedure is quite robust to nonnormally distributed data, and moreover, it is efficient in detecting process s...

Abstract: In this paper, we introduce the notion of augmentation for polytopes and use it to show the error in two presumptions that have been key in arriving at over-reaching/over-scoped claims of “impossibility” in recent extended formulations (EF) developments. One of these presumption is that: “If Polytopes P and Qare described in the spaces of variables xand yrespectively, and there exists...

The waterfall algorithm is a contrast-based hierarchical segmentation approach. In this paper we propose an efficient implementation based on the minimum spanning tree of the neighborhood graph. Furthermore, other hierarchies are proposed and compared to the original version of the algorithm.

Set k = N c 2 . Partition V into k parts of equal size: V1, V2, ...., Vk with Vi ∩ Vj = φ for i 6= j and |Vi| = Nk for all i. . Let Ei,j ⊆ E be the set of edges induced by the vertex set Vi ∪ Vj , that is Ei,j = {(u, v) ∈ E | u, v ∈ Vi ∪ Vj}. Distribute Gi,j = {Vi ∪ Vj , Ei,j} to each server and compute its minimum spanning tree Mi,j . Distribute H = ∪Mi,j to a single server and compute the fin...

We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to n1+ε while preserving the minimum spanning forest, where ε > 0 is any constant. This implies that in the congested clique model, it is sufficient to improve MST and other connectivity algorithms on graphs with slightly superlinear number of edges to obtain a gener...