157 search results - page 8 / 32 » SLIDE: A Useful Special Case of the CARDPATH Constraint |
ALGORITHMICA
2010
13 years 8 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
AI
2006
Springer
13 years 8 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
EMMCVPR
2003
Springer
14 years 1 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
RTA
2010
Springer
14 years 14 days ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
TOPLAS
2008
13 years 8 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...