Sciweavers

1381 search results - page 246 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
LATIN
2010
Springer
13 years 6 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
SIAMSC
2010
104views more  SIAMSC 2010»
13 years 6 months ago
A New Sobolev Gradient Method for Direct Minimization of the Gross--Pitaevskii Energy with Rotation
Abstract. In this paper we improve traditional steepest descent methods for the direct minimization of the Gross-Pitaevskii (GP) energy with rotation at two levels. We first defi...
Ionut Danaila, Parimah Kazemi
IALP
2009
13 years 5 months ago
Improved Reordering Rules for Hierarchical Phrase-Based Translation
Hierarchical phrase-based translation model has been proven to be a simple and powerful machine translation model. However, due to the computational complexity constraints, the ext...
Shu Cai, Yajuan Lü, Qun Liu
ICIP
2010
IEEE
13 years 5 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
TCOM
2011
92views more  TCOM 2011»
13 years 2 months ago
Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics
Bit-interleaved coded modulation (BICM) has become the de facto coding standard for communication systems. Recently, BICM has been cast as a mismatched decoding scheme due to the ...
Trung Thanh Nguyen 0001, Lutz H.-J. Lampe