Results 141 to 150 of about 432 (182)
Analog Front-End ASIC for Compact Silicon Photomultiplier Sensor Interfaces in Mixed-Signal Systems. [PDF]
Badoni D +7 more
europepmc +1 more source
Polylepis wood acclimation strategies to ENSO events. [PDF]
Guerra A +5 more
europepmc +1 more source
Spatio-temporal patterns, trends, and oceanographic drivers of whale shark strandings in Indonesia. [PDF]
Putra MIH +15 more
europepmc +1 more source
EnsembleDesign: messenger RNA design minimizing ensemble free energy via probabilistic lattice parsing. [PDF]
Dai N +4 more
europepmc +1 more source
F-IVM: analytics over relational databases under updates. [PDF]
Kara A, Nikolic M, Olteanu D, Zhang H.
europepmc +1 more source
On 0-simple semirings, semigroup semirings, and two kinds of division semirings
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Operator Semirings of a ?-Semiring
Southeast Asian Bulletin of Mathematics, 2003T. K. Dutta, S. K. Sardar
exaly +2 more sources
On the Semiring of Skew Polynomials over a Bezout Semiring
Mathematical Notes, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Babenko, M. V., Chermnykh, V. V.
exaly +3 more sources
Locally Closed Semirings and Iteration Semirings
Monatshefte f�r Mathematik, 2004A *-semiring is an additively commutative semiring \((S,+,\cdot)\) with absorbing zero and identity 1 equipped with a star operation \(^*\colon S\to S\). If \((x+y)^*=(x^*y)^*x^*\) and \((xy)^*=1+x(yx)^*y\) for all \(x,y\in S\) then \((S,+,\cdot)\) is called a Conway semiring.
openaire +1 more source
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2007
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and why-provenance are particular cases of the same general algorithms involving semirings. This further suggests a comprehensive provenance representation that uses semirings of polynomials.
Todd J. Green +2 more
openaire +1 more source
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and why-provenance are particular cases of the same general algorithms involving semirings. This further suggests a comprehensive provenance representation that uses semirings of polynomials.
Todd J. Green +2 more
openaire +1 more source

