Results 1 to 10 of about 4,530 (127)
Model adaptation via credible local context representation
Abstract Conventional model transfer techniques, requiring the labelled source data, are not applicable in the privacy‐protected medical fields. For the challenging scenarios, recent source data‐free domain adaptation (SFDA) has become a mainstream solution but losing focus on the inter‐sample class information. This paper proposes a new Credible Local
Song Tang+4 more
wiley +1 more source
This paper explores the cloud information elements of the satellite images from a multi‐view perspective, and performs feature extraction and processing of the meteorological information it contains to learn the impact of cloud cover on photovoltaic (PV) prediction.
Yuxing Dai+5 more
wiley +1 more source
Iteration and Labelled Iteration
AbstractWe analyse the conventional sum-based representation of iteration from the perspective of programmers, and show that the syntax they suggest is fundamentally not a good representation of Java-style iteration with for, while, break, and continue.
Bram Geron, Paul Blain Levy
openaire +2 more sources
AbstractIt is shown that the discriminant of the discriminant of a multivariate polynomial has the same irreducible factors as the product of seven polynomials each of which is defined as the GCD of the generators of an elimination ideal. Under relatively mild conditions of genericity, three of these polynomials are irreducible and generate the ...
Lazard, Daniel, Mccallum, Scott
openaire +6 more sources
Iterated Law of Iterated Logarithm
Burdzy's research supported in part by NSF grant DMS 91-00244, Fondef grant F-11 and AMS Centennial Research Fellowship. San Martin's research supported in part by Fondecyt grant 1940330.
Burdzy, Krzysztof, San Martin, Jaime
openaire +3 more sources
How Iterative are Iterative Algebras?
AbstractIterative algebras are defined by the property that every guarded system of recursive equations has a unique solution. We prove that they have a much stronger property: every system of recursive equations has a unique strict solution. And we characterize those systems that have a unique solution in every iterative algebra.
Stefan Milius+2 more
openaire +2 more sources
Free iterative and iteration K-semialgebras [PDF]
We consider algebras of rational power series over an alphabet $ $ with coefficients in a commutative semiring $K$ and characterize them as the free algebras in various classes of algebraic structures.
Zoltán Ésik, Werner Kuich
openaire +3 more sources
Shelah-Stupp’s Iteration and Muchnik’s Iteration [PDF]
In the early seventies, Shelah proposed a model-theoretic construction, nowadays called “iteration”. This construction is an infinite replication in a tree-like manner where every vertex possesses its own copy of the original structure. Stupp proved that the decidability of the monadic second-order (MSO) theory is transferred from the original ...
Caucal, Didier, Knapik, Teodor
openaire +3 more sources
Iterating iterated substitution
AbstractBy iterating iterated substitution not all regular languages can be copied. Hence the smallest full hyper (1)-AFL is properly contained in ETOL, the smallest full hyper-AFL. The number of iterations of iterated substitution gives rise to a proper hierarchy. Consequently the smallest full hyper (1)-AFL is not a full principal AFL.
openaire +2 more sources
AbstractRegular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the system’s transitional semantics consequently can be modeled by finite-state transducers.
Dams, Dennis+2 more
openaire +1 more source