1381 search results - page 246 / 277 » Computational Complexity of Constraint Satisfaction |
126
click to vote
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
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...
127
click to vote
SIAMSC
2010
15 years 1 months ago
2010
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...
160
click to vote
IALP
2009
15 years 1 months ago
2009
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...
142
Voted
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
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...
103
click to vote
TCOM
2011
14 years 10 months ago
2011
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 ...