1055 search results - page 9 / 211 » Enumerations in computable structure theory |
AISC
2010
Springer
14 years 16 days ago
2010
Springer
Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus fo...
MM
1996
ACM
13 years 12 months ago
1996
ACM
Narrative structure models are useful tools for understanding how and why narratives of any medium affect an audience's level of participation in their role of story reconstr...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
ISMIS
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
IPCO
1992
13 years 9 months ago
1992
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...