Results 181 to 190 of about 337 (222)
Some of the next articles are maybe not open access.
Boundedness and Complete Distributivity
Applied Categorical Structures, 2001In a previous paper [\textit{R. Rosebrugh} and \textit{R. J. Wood}, Appl. Categ. Struct. 2, No. 2, 119-144 (1994; Zbl 0804.06013)], the authors showed that there was a bi-equivalence between the 2-categories of constructively completely distributive lattices with sup-preserving arrows and that of the idempotent splitting completion of the 2-category of
Robert D. Rosebrugh, Richard J. Wood
openaire +2 more sources
Constructive complete distributivity IV
Applied Categorical Structures, 1991AbstractA complete lattice, L, is constructively completely distributive, (CCD) (L), if the sup map defined on down-closed subobjects has a left adjoint. It was known that in Boolean toposes (CCD) (L) is equivalent to (CCD) (Lop). We show here that the latter property for all L (sufficiently, for Ω.) characterizes Boolean toposes.
Robert D. Rosebrugh, Richard J. Wood
openaire +4 more sources
2012 IEEE 12th International Conference on Data Mining, 2012
We discuss parallel and distributed algorithms for large-scale matrix completion on problems with millions of rows, millions of columns, and billions of revealed entries. We focus on in-memory algorithms that run on a small cluster of commodity nodes, even very large problems can be handled effectively in such a setup.
Christina Teflioudi +2 more
openaire +2 more sources
We discuss parallel and distributed algorithms for large-scale matrix completion on problems with millions of rows, millions of columns, and billions of revealed entries. We focus on in-memory algorithms that run on a small cluster of commodity nodes, even very large problems can be handled effectively in such a setup.
Christina Teflioudi +2 more
openaire +2 more sources
Approximation operators on complete completely distributive lattices
Information Sciences, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Keyun Qin +3 more
openaire +2 more sources
On defining ?completely distributive?
Algebra Universalis, 1984The author presents a simple self-dual law defining complete distributivity.
openaire +1 more source
Distributed election in complete networks
Distributed Computing, 1988An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and an O(n) expected message complexity is shown.
Chan, MY, Chin, FYL
openaire +4 more sources
Distributed Tensor Completion Over Networks
ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020The aim of this paper is to propose a novel distributed strategy for tensor completion, where (partial) data are collected over a network of agents with sparse, but connected, topology. The method hinges on the canonical polyadic decomposition, also known as PARAFAC, to complete the low-rank tensor in a distributed fashion.
Battiloro C., Di Lorenzo P.
openaire +2 more sources
Completely distributive completions of posets
Acta Mathematica Hungarica, 2019A $$\Delta_1$$ -completion of a poset is a completion for which, simultaneously, every element is reachable as a join of meets and a meet of joins from the original poset. We focus our attention on
openaire +1 more source
COMPLETE FAMILIES OF INVARIANT DISTRIBUTIONS
Statistics & Risk Modeling, 1999Given a family \(\mathcal{P}\) of distributions on \((\mathcal{X},\mathfrak{B}),\) a group \(G\) of measurable mappings on \((\mathcal{X},\mathfrak{B})\) and \(\mathfrak{B} (G)\) being the \(\sigma\)-algebra of invariant sets, the author gives necessary and sufficient conditions for the \(r\)-completeness of the restricted model \(\mathcal{P}\left ...
openaire +2 more sources
Symmetries Of Completely Integrable Distributions
1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dubrov, B. M., Komrakov, B. P.
openaire +2 more sources