2636 search results - page 189 / 528 » Linear Programming |
119
click to vote
HEURISTICS
2002
15 years 2 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
116
Voted
TIT
2002
15 years 2 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
119
click to vote
SIAMSC
2010
15 years 27 days ago
2010
A surface reconstruction technique based on minimization of the total variation of the gradient is introduced. Convergence of the method is established, and an interior-point algor...
124
Voted
EMNLP
2010
15 years 16 days 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...
103
click to vote
SIGDIAL
2010
15 years 11 days ago
2010
We build a model for speech disfluency detection based on conditional random fields (CRFs) using the Switchboard corpus. This model is then applied to a new domain without any ada...