Sciweavers

2944 search results - page 17 / 589
» Improving Bound Propagation
Sort
View
EMNLP
2011
12 years 7 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez
SENSYS
2004
ACM
14 years 28 days ago
The dynamic behavior of a data dissemination protocol for network programming at scale
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over...
Jonathan W. Hui, David E. Culler
CP
2005
Springer
14 years 1 months ago
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
Carsten Sinz
ICIP
2008
IEEE
14 years 9 months ago
Improved dynamic rate shaping for H.264/AVC video streams
In this paper, dynamic rate shaping for H.264/AVC intracoded video streams is investigated. An analysis of the distortion distinguishes different error components that lead to the...
Stijn Notebaert, Jan De Cock, Kenneth Vermeirsch, ...
ACL
2011
12 years 11 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez