4451 search results - page 313 / 891 » On Random Ordering Constraints |
180
click to vote
ACL
2012
13 years 9 months ago
2012
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
212
click to vote
JSAT
2006
15 years 6 months ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
176
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
167
click to vote
IDEAS
2007
IEEE
16 years 1 months ago
2007
IEEE
The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this ...
188
click to vote
AI
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...