592 search results - page 84 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
123
click to vote
ICDAR
2005
IEEE
15 years 8 months ago
2005
IEEE
Cheap and versatile cameras make it possible to easily and quickly capture a wide variety of documents. However, low resolution cameras present a challenge to OCR because it is vi...
139
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
136
click to vote
CP
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
155
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
131
click to vote
SAC
1994
ACM
15 years 7 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...