729 search results - page 75 / 146 » Solving subgraph isomorphism problems with constraint progra... |
160
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
141
click to vote
CC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
157
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents a novel approach for landmarkbased shape deformation, in which fitting error and shape difference are formulated into a support vector machine (SVM) regression...
177
click to vote
IJCAI
1989
15 years 7 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
146
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...