4451 search results - page 16 / 891 » On Random Ordering Constraints |
CPAIOR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
110
click to vote
AML
1999
14 years 11 months ago
1999
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
100
click to vote
ACISP
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...
NAACL
2007
15 years 1 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
150
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper presents an algorithm for order reduction of
factors in High-Order Markov Random Fields (HOMRFs).
Standard techniques for transforming arbitrary high-order
factors in...