5158 search results - page 295 / 1032 » Generalization of the Dempster-Shafer Theory |
161
click to vote
ENTCS
2002
15 years 6 months ago
2002
The uniformity principle for traced monoidal categories has been introduced as a natural generalization of the uniformity principle (Plotkin's principle) for fixpoint operato...
185
click to vote
ENTCS
2002
15 years 6 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
171
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
165
click to vote
MOC
2000
15 years 6 months ago
2000
Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed deg...
159
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...