Dual Coordinate Descent Algorithms for Efficient Large Margin Structured Prediction | Citedby Results | Transactions of the Association for Computational Linguistics | MIT Press

Skip to Main Content

Skip Nav Destination

Dual Coordinate Descent Algorithms for Efficient Large Margin Structured Prediction

Transactions of the Association for Computational Linguistics (2013) 1: 207–218.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Named Entity Recognition and Relation Extraction

Zara Nasar
Syed Waqar Jaffry
Muhammad Kamran Malik

ACM Computing Surveys (2022) 54 (1): 1.

Distributed block-diagonal approximation methods for regularized empirical risk minimization

Ching-pei Lee
Kai-Wei Chang

Machine Learning (2020) 109 (4): 813.

Information extraction from scientific articles: a survey

Zara Nasar
Syed Waqar Jaffry
Muhammad Kamran Malik

Scientometrics (2018) 117 (3): 1931.

Lessons learnt from the Named Entity rEcognition and Linking (NEEL) challenge series

Giuseppe Rizzo
Bianca Pereira
Andrea Varga
Marieke van Erp
Amparo Elizabeth Cano Basave
Andreas Hotho
Robert Jäschke
Kristina Lerman
Andreas Hotho
Robert Jäschke
Kristina Lerman

Semantic Web (2017) 8 (5): 667.

Integrated inference and learning of neural factors in structural support vector machines

Rein Houthooft
Filip De Turck

Pattern Recognition (2016) 59: 292.