363 search results - page 46 / 73 » Decomposition of the NVALUE constraint |
ICML
2004
IEEE
15 years 3 months ago
2004
IEEE
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
CAIP
1997
Springer
15 years 1 months ago
1997
Springer
An algorithm for optical ow estimation is presented for the case of discrete-time motion of an uncalibrated camera through a rigid world. Unlike traditional optical ow approaches t...
78
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
131
click to vote
CP
2005
Springer
15 years 3 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...