Sciweavers

154 search results - page 13 / 31
» ets 2011
Sort
View
ICALP
2011
Springer
14 years 27 days ago
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
Silvia Crafa, Francesco Ranzato
162
Voted
EMMCVPR
2011
Springer
13 years 9 months ago
Curvature Regularity for Multi-label Problems - Standard and Customized Linear Programming
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
Thomas Schoenemann, Yubin Kuang, Fredrik Kahl
66
Voted
EMNLP
2011
13 years 9 months ago
Exact Decoding of Phrase-Based Translation Models through Lagrangian Relaxation
This paper describes an algorithm for exact decoding of phrase-based translation models, based on Lagrangian relaxation. The method recovers exact solutions, with certificates of...
Yin-Wen Chang, Michael Collins
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
13 years 9 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
JMLR
2011
105views more  JMLR 2011»
14 years 4 months ago
Posterior Sparsity in Unsupervised Dependency Parsing
A strong inductive bias is essential in unsupervised grammar induction. In this paper, we explore a particular sparsity bias in dependency grammars that encourages a small number ...
Jennifer Gillenwater, Kuzman Ganchev, João ...