465 search results - page 34 / 93 » On the Hardness of Range Assignment Problems |
113
click to vote
NIPS
2007
15 years 1 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
ESOP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Program inversion has many applications such as in the implementation of serialization/deserialization and in providing support for redo/undo, and has been studied by man...
COLING
2008
15 years 1 months ago
2008
In this paper we present a study on the interpretation of weekday names in texts. Our algorithm for assigning a date to a weekday name achieves 95.91% accuracy on a test data set ...
DATE
2007
IEEE
15 years 6 months ago
2007
IEEE
Design closure becomes hard to achieve at physical layout stage due to the emergence of long global interconnects. Consequently, interconnect planning needs to be integrated in hi...
HAIS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Color constancy and chromatic edge detection are fundamental problems in artificial vision. In this paper1 we present a way to provide a visualization of color constancy...