706 search results - page 64 / 142 » Super Solutions in Constraint Programming |
KDD
2002
ACM
16 years 7 days ago
2002
ACM
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...
115
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
3?D shape recovery of non-rigid surfaces from 3?D to 2?D correspondences is an under-constrained problem that requires prior knowledge of the possible deformations. State-of-the-a...
JISE
2006
14 years 11 months ago
2006
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
ISNN
2005
Springer
15 years 5 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
137
click to vote
ISPD
1997
ACM
15 years 4 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...