187 search results - page 23 / 38 » On the Natural Imprint Function of a Graph |
155
click to vote
EMNLP
2010
15 years 3 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
160
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
162
click to vote
INFORMS
2010
15 years 3 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
177
click to vote
APPROX
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
165
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...