Results 21 to 30 of about 5,940,643 (309)
Lower Bounds for Approximate LDCs [PDF]
, 2014 We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(α,δ)$-approximate LDC is a set $V$ of $n$ points in $\mathbb{R}^d$ so that, for each $i \in [d]$ there are $Ω(δn)$ disjoint $q$-tuples $(\vec{u}_1,\ldots,\vec{u}_q) $ in $V$ so that
J. Briët (Jop) +3 more
openaire +5 more sources
Generalized Lower and Upper Approximations in Quantales [PDF]
Journal of Applied Mathematics, 2012 We introduce the concepts of set‐valued homomorphism and strong set‐valued homomorphism of a quantale which are the extended notions of congruence and complete congruence, respectively. The properties of generalized lower and upper approximations, constructed by a set‐valued mapping, are discussed.
Qimei Xiao, Qingguo Li
openaire +5 more sources
The Lattice Structures of Approximation Operators Based on L-Fuzzy Generalized Neighborhood Systems
Complexity, 2021 Following the idea of L-fuzzy generalized neighborhood systems as introduced by Zhao et al., we will give the join-complete lattice structures of lower and upper approximation operators based on L-fuzzy generalized neighborhood systems. In particular, as
Qiao-Ling Song +5 more
doaj +1 more source
The lower tail: Poisson approximation revisited [PDF]
Random Structures & Algorithms, 2015 The well-known "Janson's inequality" gives Poisson-like upper bounds for the lower tail probability \Pr(X \le (1-\eps)\E X) when X is the sum of dependent indicator random variables of a special form. We show that, for large deviations, this inequality is optimal whenever X is approximately Poisson, i.e., when the dependencies are weak. We also present
Svante Janson, Lutz Warnke
openaire +4 more sources
Misinformation Correction Maximization Problem with Edge Addition in Social Networks [PDF]
Jisuanji kexue, 2022 The popularity of online social networks such as Wechat has aroused people’s more attention to information diffusion.The spread of misinformation in social networks may lead to serious consequences,such as economic losses and public panic.Therefore ...
SONG Xin-yue, SHUAI Tian-ping, CHEN Bin
doaj +1 more source
Streaming Algorithms with Large Approximation Factors [PDF]
, 2022 We initiate a broad study of classical problems in the streaming model with insertions and deletions in the setting where we allow the approximation factor α to be much larger than 1.
Zhang, Yuheng +3 more
core +1 more source
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +3 more
core +1 more source
A New Single-Valued Neutrosophic Rough Sets and Related Topology
Journal of Mathematics, 2021 (Fuzzy) rough sets are closely related to (fuzzy) topologies. Neutrosophic rough sets and neutrosophic topologies are extensions of (fuzzy) rough sets and (fuzzy) topologies, respectively. In this paper, a new type of neutrosophic rough sets is presented,
Qiu Jin +3 more
doaj +1 more source
Unsupervised Attribute Reduction Algorithm for Mixed Data Based on Fuzzy Optimal Approximation Set
Mathematics, 2023 Fuzzy rough set theory has been successfully applied to many attribute reduction methods, in which the lower approximation set plays a pivotal role. However, the definition of lower approximation used has ignored the information conveyed by the upper ...
Haotong Wen, Shixin Zhao, Meishe Liang
doaj +1 more source
Lower Bounds for Approximate Knowledge Compilation [PDF]
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020 Knowledge compilation studies the trade-off between succinctness and efficiency of different representation languages. For many languages, there are known strong lower bounds on the representation size, but recent work shows that, for some languages, one can bypass these bounds using approximate compilation.
Alexis de Colnet, Stefan Mengel
openaire +4 more sources