Fetching the paper…
Reading the bibliography…
Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels.
Further results on the rate of convergence to the connective constant of the hypercubical lattice
J. M. Hammersley and D. J. A. Welsh · 1962
Earlier work this paper cites.
On the dimer solution of planar Ising models
Michael E Fisher · 1966
Earlier work this paper cites.
On the computational complexity of Ising spin glass models
Francisco Barahona · 1982
Earlier work this paper cites.
Global min-cuts in rnc, and other ramifications of a simple min-out algorithm
David R Karger · 1993
Earlier work this paper cites.
The self-avoiding walk
Neal Madras and Gordon Slade · 1993
Earlier work this paper cites.
Graph Theory
R. Diestel · 1997
Earlier work this paper cites.
Percolation
Geoffrey Grimmett · 1999
Earlier work this paper cites.
Size and area of square lattice polygons
Iwan Jensen · 2000
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
Anne Condon and Richard M Karp · 2001
Earlier work this paper cites.
Heuristics for semirandom graph problems
Uriel Feige and Joe Kilian · 2001
Earlier work this paper cites.
Conditional random fields: Probabilistic models for segmenting and labeling sequence data
J. Lafferty, A. McCallum, and F. Pereira · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
Frank McSherry · 2001
Earlier work this paper cites.
Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms
M. Collins · 2002
Earlier work this paper cites.
Hidden Markov support vector machines
Y. Altun, I. Tsochantaridis, and T. Hofmann · 2003
Cited alongside, same era.
Max-margin Markov networks
B. Taskar, C. Guestrin, and D. Koller · 2003
Cited alongside, same era.
Correlation clustering
Nikhil Bansal, Avrim Blum, and Shuchi Chawla · 2004
Cited alongside, same era.
Error bounds for correlation clustering
Thorsten Joachims and John E. Hopcroft · 2005
Cited alongside, same era.
Optimal phylogenetic reconstruction
Constantinos Daskalakis, Elchanan Mossel, and Sébastien Roch · 2006
Cited alongside, same era.
Correlation clustering with a fixed number of clusters
Ioannis Giotis and Venkatesan Guruswami · 2006
Cited alongside, same era.
Minimizing nonsubmodular functions with graph cuts-a review
Concentration of measure for the analysis of randomized algorithms
Devdatt P Dubhash and Alessandro Panconesi · 2009
Later among the works it cites.
Dual decomposition for parsing with non-projective head automata
Terry Koo, Alexander M Rush, Michael Collins, Tommi Jaakkola, and David Sontag · 2010
Later among the works it cites.
Correlation clustering with noisy input
Claire Mathieu and Warren Schudy · 2010
Later among the works it cites.
Are stable instances easy?
Yonatan Bilu and Nathan Linial · 2012
Later among the works it cites.
A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
Nathan Clisby and Iwan Jensen · 2012
Later among the works it cites.
Efficiently searching for frustrated cycles in MAP inference
David Sontag, Do Kook Choe, and Yitao Li · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Vladimir Kolmogorov and Carsten Rother · 2007
Cited alongside, same era.
Noisy sorting without resampling
Mark Braverman and Elchanan Mossel · 2008
Cited alongside, same era.
Tightening LP relaxations for MAP using message-passing
David Sontag, Talya Meltzer, Amir Globerson, Yair Weiss, and Tommi Jaakkola · 2008
Cited alongside, same era.
Graph cut based image segmentation with connectivity priors
Sara Vicente, Vladimir Kolmogorov, and Carsten Rother · 2008
Cited alongside, same era.
Message passing algorithms and improved lp decoding
Sanjeev Arora, Constantinos Daskalakis, and David Steurer · 2009
Cited alongside, same era.
Finding low error clusterings
Maria-Florina Balcan and Mark Braverman · 2009
Cited alongside, same era.
An efficient branch-and-bound algorithm for optimal human pose estimation
Min Sun, Murali Telaprolu, Honglak Lee, and Silvio Savarese · 2012
Later among the works it cites.
A tensor spectral approach to learning mixed membership community models
Anima Anandkumar, Rong Ge, Daniel Hsu, and Sham M Kakade · 2013
Later among the works it cites.
Clustering under approximation stability
Maria-Florina Balcan, Avrim Blum, and Anupam Gupta · 2013
Later among the works it cites.
A comparative study of modern inference techniques for discrete energy minimization problems
J.H. Kappes, B. Andres, F.A. Hamprecht, C. Schnorr, S. Nowozin, D. Batra, Sungwoong Kim, B.X. Kausler, J. Lellmann, N. Komodakis, and C. Rother · 2013
Later among the works it cites.
Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery
Emmanuel Abbe, Afonso S. Bandeira, Annina Bracher, and Amit Singer · 2014
Closest in time.
Information recovery from pairwise measurements
Yuxin Chen and Andrea J. Goldsmith · 2014
Closest in time.