7092 search results - page 363 / 1419 » Parallelizing constraint programs |
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
The need for video summarization originates primarily from a viewing time or a bit budget constraint. A shorter version of the original video sequence is desirable in a number of ...
129
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
219
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
132
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
121
click to vote
AICCSA
2006
IEEE
15 years 9 months ago
2006
IEEE
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...