Results 1 to 10 of about 2,172,385 (299)
Upper Domination: Complexity and Approximation [PDF]
, 2016 We consider Upper Domination, the problem of finding a maximum cardinality minimal dominating set in a graph. We show that this problem does not admit an \(n^{1-\epsilon }\) approximation for any \(\epsilon >0\), making it significantly harder than Dominating Set, while it remains hard even on severely restricted special cases, such as cubic graphs ...
Cristina Bazgan +9 more
core +4 more sources
Estimates of the Approximation Error Using Rademacher Complexity: Learning Vector-Valued Functions [PDF]
Journal of Inequalities and Applications, 2009 For certain families of multivariable vector-valued functions to be approximated, the accuracy of approximation schemes made up of linear combinations of computational units containing adjustable parameters is investigated.
Giorgio Gnecco, Marcello Sanguineti
doaj +2 more sources
Topological structures induced by chromatic partitioning of vertex set of graphic [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 This paper presents a method of constructing topologies on vertex set of a graph G induced by chromatic partition of vertex set of the graph. It introduces colour lower approximation and colour upper approximation of vertex induced subgraphs and ...
K. Lalithambigai, P. Gnanachandra
doaj +1 more source
On Topological Properties of Generalized Rough Approximation Operators [PDF]
Jisuanji kexue, 2022 Rough set theory is a mathematical tool for dealing with uncertain information.The core notions of rough set theory is approximation operators of approximation spaces.Pawlak approximation operators are established by using equivalence relations on the ...
LI Yan-yan, QIN Ke-yun
doaj +1 more source
Rough Semigroups in Connection with Single Valued Neutrosophi c (∈, ∈)-Ideals [PDF]
Neutrosophic Sets and Systems, 2022 The scheme of rough sets is an effective procedure that handle ambiguous, inexact or uncertain information configuration. Rough set theory for algebraic structures like semigroups is a formal approximation space consisting of a universal set and an ...
Young Bae Jun +2 more
doaj +1 more source
Upper Bound Approximation for BlockMaxWand [PDF]
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017 BlockMaxWand is a recent advance on the Wand dynamic pruning technique, which allows efficient retrieval without any e.ectiveness degradation to rank K. However, while BMW uses docid-sorted indices, it relies on recording the upper bound of the term weighting model scores for each block of postings in the inverted index.
Craig Macdonald, Nicola Tonellotto
openaire +3 more sources
On upper approximations of Pareto fronts [PDF]
Journal of Global Optimization, 2018 In one of our earlier works, we proposed to approximate Pareto fronts to multiobjective optimization problems by two-sided approximations, one from inside and another from outside of the feasible objective set, called, respectively, lower shell and upper shell. We worked there under the assumption that for a given problem an upper shell exists.
Ignacy Kaliszewski, Janusz Miroforidis
openaire +3 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
Roughness of Filters in Equality Algebras
Bulletin of the Section of Logic, 2023 Rough set theory is an excellent mathematical tool for the analysis of a vague description of actions in decision problems. Now, in this paper by considering the notion of an equality algebra, the notion of the lower and the upper approximations are ...
Gholam Reza Rezaei +3 more
doaj +1 more source
Axioms, 2021 For L a complete co-residuated lattice and R an L-fuzzy relation, an L-fuzzy upper approximation operator based on co-implication adjoint with L is constructed and discussed.
Qiu Jin, Lingqiang Li
doaj +1 more source