2944 search results - page 414 / 589 » Improving Bound Propagation |
187
click to vote
NAACL
2010
15 years 4 months ago
2010
Typical statistical machine translation systems are trained with static parallel corpora. Here we account for scenarios with a continuous incoming stream of parallel training data...
184
click to vote
ICCAD
2010
IEEE
15 years 3 months ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
183
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
181
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
205
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...