729 search results - page 75 / 146 » Solving subgraph isomorphism problems with constraint progra... |
130
Voted
ECAI
2004
Springer
15 years 9 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 ...
117
Voted
CC
2005
Springer
15 years 9 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...
130
Voted
ICCV
2003
IEEE
16 years 5 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...
136
Voted
IJCAI
1989
15 years 5 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...
119
click to vote
DAC
2005
ACM
16 years 4 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...