Sciweavers

626 search results - page 99 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
TSP
2008
115views more  TSP 2008»
13 years 5 months ago
The Estimation of Laplace Random Vectors in Additive White Gaussian Noise
This paper develops and compares the maximum a posteriori (MAP) and minimum mean-square error (MMSE) estimators for spherically contoured multivariate Laplace random vectors in add...
Ivan W. Selesnick
MT
2010
96views more  MT 2010»
13 years 5 months ago
Monte Carlo techniques for phrase-based translation
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative ap...
Abhishek Arun, Barry Haddow, Philipp Koehn, Adam L...
IACR
2011
206views more  IACR 2011»
12 years 7 months ago
Shortest Lattice Vectors in the Presence of Gaps
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
Mingjie Liu, Xiaoyun Wang, Guangwu Xu, Xuexin Zhen...
RANDOM
1998
Springer
13 years 11 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
AIPS
2004
13 years 8 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf