125 search results - page 13 / 25 » N Semantic Classes are Harder than Two |
68
Voted
ICIP
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no...
102
click to vote
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
PPDP
2000
Springer
15 years 1 months ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...