Results 1 to 10 of about 505,352 (366)
High-entropy high-hardness metal carbides discovered by entropy descriptors [PDF]
Nature Communications, 2018 High-entropy materials have attracted considerable interest due to the combination of useful properties and promising applications. Predicting their formation remains the major hindrance to the discovery of new systems.
P. Sarker +8 more
semanticscholar +1 more source
Flexural Strength and Hardness of Filler-Reinforced PMMA Targeted for Denture Base Application
Materials, 2021 The aim of this work was to evaluate the flexural strength and surface hardness of heat-cured Polymethyl methacrylate (PMMA) modified by the addition of ZrO2 nanoparticles, TiO2 nanoparticles, and E-glass fibre at different wt.% concentrations. Specimens
A. Alhotan +4 more
semanticscholar +1 more source
Hardness-Aware Deep Metric Learning [PDF]
Computer Vision and Pattern Recognition, 2019 This paper presents a hardness-aware deep metric learning (HDML) framework. Most previous deep metric learning methods employ the hard negative mining strategy to alleviate the lack of informative samples for training.
Wenzhao Zheng +3 more
semanticscholar +1 more source
The hardness of conditional independence testing and the generalised covariance measure [PDF]
Annals of Statistics, 2018 It is a common saying that testing for conditional independence, i.e., testing whether whether two random vectors $X$ and $Y$ are independent, given $Z$, is a hard statistical problem if $Z$ is a continuous random variable (or vector).
Rajen Dinesh Shah, J. Peters
semanticscholar +1 more source
Transferability and Hardness of Supervised Classification Tasks [PDF]
IEEE International Conference on Computer Vision, 2019 We propose a novel approach for estimating the difficulty and transferability of supervised classification tasks. Unlike previous work, our approach is solution agnostic and does not require or assume trained models.
A. Tran, Cuong V Nguyen, Tal Hassner
semanticscholar +1 more source
Hardness of approximate nearest neighbor search [PDF]
Symposium on the Theory of Computing, 2018 We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance.
A. Rubinstein
semanticscholar +1 more source
On the concrete hardness of Learning with Errors
Journal of Mathematical Cryptology, 2015 The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE.
Martin R. Albrecht +2 more
semanticscholar +1 more source
The Hall–Petch and inverse Hall–Petch relations and the hardness of nanocrystalline metals
Journal of Materials Science, 2019 We review some of the factors that influence the hardness of polycrystalline materials with grain sizes less than 1 µm. The fundamental physical mechanisms that govern the hardness of nanocrystalline materials are discussed.
Sneha N. Naik, S. Walley
semanticscholar +1 more source
Self-consistent determination of hard modes in hot QCD [PDF]
Phys.Rev.D55:4997-5014,1997; Erratum-ibid.D56:2475,1997, 1996 We determine self-consistently the hard-quark and hard-gluon modes in hot QCD. The damping-rate part in resummed hard-quark or hard-gluon propagators, rather than the thermal-mass part, plays the dominant role.
arxiv +1 more source
Proof verification and hardness of approximation problems
Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992 The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that used O(f(n)) random bits, queries O(g(n)) bits of its oracle and behaves as follows: If x in L then there exists an oracle y ...
Sanjeev Arora +4 more
semanticscholar +1 more source