منابع مشابه
(Almost) No Label No Cry
In Learning with Label Proportions (LLP), the objective is to learn a supervised classifier when, instead of labels, only label proportions for bags of observations are known. This setting has broad practical relevance, in particular for privacy preserving data processing. We first show that the mean operator, a statistic which aggregates all labels, is minimally sufficient for the minimization...
متن کاملAlmost No-Scale Supergravity
We construct an explicit 5-dimensional supergravity model that realizes the ‘no scale’ mechanism for supersymmetry breaking with no unstable moduli. Supersymmetry is broken by a constant superpotential localized on a brane, and the radion is stabilized by Casimir energy from supergravity and massive hypermultiplets. If the standard model gauge and matter fields are localized on a brane, then vi...
متن کاملDistributed Hashing is No Longer Considered Unsafe
The expansion of multicast methods is a compelling question. After years of widespread research into hierarchical databases, we verify the synthesis of consistent hashing. In order to achieve this aim, we concentrate our efforts on validating that XML and write-back caches are always unable to get along and therefore distributed hashing is no longer considered unsafe.
متن کاملRings for which every simple module is almost injective
We introduce the class of “right almost V-rings” which is properly between the classes of right V-rings and right good rings. A ring R is called a right almost V-ring if every simple R-module is almost injective. It is proved that R is a right almost V-ring if and only if for every R-module M, any complement of every simple submodule of M is a direct summand. Moreover, R is a right almost V-rin...
متن کاملAlmost Optimal Hash Sequence Traversal
We introduce a novel technique for computation of consecutive preimages of hash chains. Whereas traditional techniques have a memory-times-computation complexity of O(n) per output generated, the complexity of our technique is only O(log n), where n is the length of the chain. Our solution is based on the same principal amortization principle as [1], and has the same asymptotic behavior as this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae (Proceedings)
سال: 1964
ISSN: 1385-7258
DOI: 10.1016/s1385-7258(64)50053-0