1055 search results - page 99 / 211 » Enumerations in computable structure theory |
134
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
168
Voted
PODS
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
136
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
133
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
According to Shannon Sampling Theory, Fourier interpolation is the optimal way to reach subpixel accuracy from a properly-sampled digital image. However, for most images this inte...
131
click to vote
FOCM
2011
14 years 8 months ago
2011
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...