Results 221 to 230 of about 698,739 (268)
Editorial: Robust machine learning. [PDF]
Front Artif IntellAn Y, Zhao X, Du M.
europepmc +1 more source
Adaptive Multi-Model Hierarchical Federated Learning for Robust IoT Intrusion Detection. [PDF]
Sensors (Basel)Latif S, Djenouri D.
europepmc +1 more source
Some of the next articles are maybe not open access.
Robust kernels for robust location estimation
Neurocomputing, 2021Abstract This paper shows that least-square estimation (mean calculation) in a reproducing kernel Hilbert space (RKHS) F corresponds to different M-estimators in the original space depending on the kernel function associated with F . In particular, we present a proof of the correspondence of mean estimation in an RKHS for the Gaussian ...
Joseph Alejandro Gallego +2 more
openaire +1 more source
Proceedings of the 2004 American Control Conference, 2004
The problem of linear model reduction is addressed. Given a state-space model of a linear time-invariant system, a model of prescribed order is obtained such that the H/sub 2/-norm of the difference between the transference of the two models is minimized. The reduced model is modeled as having the same order as the system but with a nonminimal observer
Yoram Halevi, Uri Shaked
openaire +1 more source
The problem of linear model reduction is addressed. Given a state-space model of a linear time-invariant system, a model of prescribed order is obtained such that the H/sub 2/-norm of the difference between the transference of the two models is minimized. The reduced model is modeled as having the same order as the system but with a nonminimal observer
Yoram Halevi, Uri Shaked
openaire +1 more source
SIAM Journal on Discrete Mathematics, 2002
Summary: We consider complete graphs with nonnegative edge weights. A \(p\)-matching is a set of \(p\) disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching \(M\) that contains for any \(p\leq|M|\) \(p\) edges whose total weight is at least \({1\over \sqrt 2}\) of the maximum weight of a \(p\)-matching.
Refael Hassin, Shlomi Rubinstein
openaire +2 more sources
Summary: We consider complete graphs with nonnegative edge weights. A \(p\)-matching is a set of \(p\) disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching \(M\) that contains for any \(p\leq|M|\) \(p\) edges whose total weight is at least \({1\over \sqrt 2}\) of the maximum weight of a \(p\)-matching.
Refael Hassin, Shlomi Rubinstein
openaire +2 more sources
Enforcing Robust Declassification and Qualified Robustness
Journal of Computer Security, 2006Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems release sensitive information as part of their intended function and therefore violate noninterference. To control information flow while permitting information release, some systems have a downgrading or declassification ...
Andrew C. Myers +2 more
openaire +1 more source
Journal of Economic Theory, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Robust Multiobjective Optimization With Robust Consensus
IEEE Transactions on Fuzzy Systems, 2018Consider a multiobjective robust optimization problem, where a set of weighted decision makers provides their preferences a priori . The preferences are provided either in the objective space or in the decision variable space using fuzzy numbers. To solve this problem, an indicator to measure consensus, an indicator to measure the robustness of the ...
Kaustuv Nag +3 more
openaire +1 more source
Robustness indices and robust prioritization in QFD
Expert Systems with Applications, 2009The prioritization of engineering characteristics (ECs) provides an important basis for decision-making in QFD. However, the prioritization results in the conventional QFD may be misleading since it does not consider the uncertainty of input information.
Kim, DH, Kim, KJ
openaire +2 more sources