2314 search results - page 5 / 463 » Monoids over domains |
89
Voted
FSTTCS
2003
Springer
15 years 2 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
TCS
2008
14 years 9 months ago
2008
The stabilizer of an infinite word w over a finite alphabet is the monoid of morphisms over that fix w. In this paper we study various problems related to stabilizers and their g...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Coalgebras are categorical presentations of state-based systems. In investigating parallel composition of coalgebras (realizing concurrency), we observe that the same alg...
IJAC
2010
14 years 4 months ago
2010
A finite poset (P S) determines a finite dimensional algebra TP over the field over the field F of two elements, with an upper triangular representation. We determine the structure...
126
click to vote
SIGIR
2012
ACM
12 years 12 months ago
2012
ACM
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...