1055 search results - page 61 / 211 » Enumerations in computable structure theory |
ISCAS
2003
IEEE
15 years 3 months ago
2003
IEEE
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
102
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
FUIN
2006
14 years 9 months ago
2006
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
POPL
2012
ACM
13 years 5 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
SEMWEB
2007
Springer
15 years 3 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...