Results 21 to 30 of about 2,986,842 (293)
Dynamic Boundary of P-Set and Intelligent Acquisition for Two Types of Information Fusion
Computers, 2020 The development of information technology brings the challenge of data redundancy and data shortage to information fusion. Based on the dynamic boundary characteristics of p-set, this paper analyzes the structure and generation of p-augmented matrix, and
Shouwei Li, Yao Xiao, Kaiquan Shi
doaj +1 more source
Deciding equivalence-based properties using constraint solving [PDF]
, 2013 Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy or authentication.
Véronique Cortier +5 more
core +1 more source
Sensors, 2023 Currently, a significant focus has been established on the privacy protection of multi-dimensional data publishing in various application scenarios, such as scientific research and policy-making.
Bing Su +5 more
doaj +1 more source
The Domination Equivalence Classes of Paths
Australas. J Comb., 2017 31 pages, 1 ...
Iain Beaton, Jason I. Brown
openaire +4 more sources
An Equivalence Class for Orthogonal Vectors [PDF]
, 2019 To appear in SODA 2019.
Lijie Chen 0001, Ryan Williams 0001
openaire +3 more sources
Invariants of vector configurations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We investigate the Zariski closure of the projective equivalence class of a matrix. New results are presented regarding the matrices in this variety and their matroids, and we give equations for the variety.
Andrew Berget, Alex Fink
doaj +1 more source
The binomial equivalence classes of finite words [PDF]
International Journal of Algebra and Computation, 2020 Two finite words [Formula: see text] and [Formula: see text] are [Formula: see text]-binomially equivalent if, for each word [Formula: see text] of length at most [Formula: see text], [Formula: see text] appears the same number of times as a subsequence (i.e., as a scattered subword) of both [Formula: see text] and [Formula: see text].
Lejeune, Marie +2 more
openaire +2 more sources
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas [PDF]
, 2011 The article attached is a preprint version of the final published article which can be accessed at the link below. The article title has been changed. For referencing purposes please use the published details. Copyright © 2010 Elsevier B.V.
Laurence, MR +10 more
core +1 more source
Identification and signatures based on NP-hard problems of indefinite quadratic forms
Journal of Mathematical Cryptology, 2008 We prove NP-hardness of equivalence and representation problems of quadratic forms under probabilistic reductions, in particular for indefinite, ternary quadratic forms with integer coefficients.
Hartung Rupert J., Schnorr Claus-Peter
doaj +1 more source
Trace Equivalence Decision: Negative Tests and Non-determinism [PDF]
, 2011 We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-type properties, like anonymity, vote-privacy, and unlinkability.
Hubert Comon-Lundh +5 more
core +1 more source