2314 search results - page 88 / 463 » Monoids over domains |
124
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper considers the problem of construction of low-pass filters on the unit sphere, which has wide ranging applications in the processing of signals on the unit sphere. We p...
79
Voted
CSL
2004
Springer
15 years 5 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
ISSAC
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
101
click to vote
CSL
2010
Springer
15 years 1 months ago
2010
Springer
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
115
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...