192 search results - page 19 / 39 » Boolean Matching Using Generalized Reed-Muller Forms |
AI
2006
Springer
14 years 11 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...
102
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper introduces a new method for shape registration by matching vector distance functions. The vector distance function representation is more flexible than the conventional...
STOC
1989
ACM
15 years 3 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
107
Voted
CSL
2010
Springer
15 years 24 days ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
102
click to vote
ICCBR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a case-based reasoning technique based on conceptual neighborhoods of cases. The system applies domain knowledge to the case retrieval process in the form of r...