1921 search results - page 41 / 385 » Making AC-3 an Optimal Algorithm |
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
For the past two decades, fractals (e.g., the Hilbert and Peano space-filling curves) have been considered the natural method for providing a locality-preserving mapping. The idea...
GLOBECOM
2007
IEEE
13 years 7 months ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of finding a door along a wall with a blind robot that neither knows the distance to the door nor the direction towards of the door. This problem can be so...
COCO
1995
Springer
13 years 11 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
ICIP
2000
IEEE
14 years 1 days ago
2000
IEEE
Abstract—We describe a trellis-based algorithm which enables R-D optimum quantization decisions in the H.263+ video coding standard. The algorithm allows the quantization decisio...