2801 search results - page 238 / 561 » On the Adequateness of the Connection Method |
178
click to vote
SMI
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper expands the role of the new field of computational topology by surveying methods for incorporating connectedness in shape modeling. Two geometric representations in par...
167
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
In probabilistics, reasoning at optimum entropy (ME-reasoning) has proved to be a most sound and consistent method for inference. This paper investigates its properties in the fram...
205
click to vote
COCO
1993
Springer
15 years 10 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
209
click to vote
ADBIS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
171
click to vote
AAAI
2008
15 years 9 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...