Hardness

Results: 758



#Item
21JCAMECH Vol. 49, No. 1, June 2018, ppDOI: JCAMECHEffect of the asymmetrical rolling process on the micro hardness and microstructure of brass wire

JCAMECH Vol. 49, No. 1, June 2018, ppDOI: JCAMECHEffect of the asymmetrical rolling process on the micro hardness and microstructure of brass wire

Add to Reading List

Source URL: jcamech.ut.ac.ir

Language: English - Date: 2018-08-15 11:08:34
    22STEEL TERMS AND DEFINITIONS A Age Hardening Degeneration of steel that increases hardness and strength while decreasing ductility. This process normally follows rapid cooling or cold working.

    STEEL TERMS AND DEFINITIONS A Age Hardening Degeneration of steel that increases hardness and strength while decreasing ductility. This process normally follows rapid cooling or cold working.

    Add to Reading List

    Source URL: www.iceweb.com.au

    Language: English - Date: 2014-04-03 21:09:41
      23DRINKING WATER INSPECTORATE Water hardness What causes hard water? Rain water is naturally soft but once it falls on the ground and percolates through rocks it picks up natural hardness minerals, such as calcium and mag

      DRINKING WATER INSPECTORATE Water hardness What causes hard water? Rain water is naturally soft but once it falls on the ground and percolates through rocks it picks up natural hardness minerals, such as calcium and mag

      Add to Reading List

      Source URL: www.dwi.gov.uk

      Language: English - Date: 2013-07-11 11:33:07
        24Post-Quantum CryptographyList of Accepted Papers 1. The Hardness of Code Equivalence over Fq and its Application to Code-based Cryptography Nicolas Sendrier and Dimitris E. Simos

        Post-Quantum CryptographyList of Accepted Papers 1. The Hardness of Code Equivalence over Fq and its Application to Code-based Cryptography Nicolas Sendrier and Dimitris E. Simos

        Add to Reading List

        Source URL: pqcrypto2013.xlim.fr

        Language: English - Date: 2013-06-24 09:53:49
          25

          This material is Open Game Content, and is licensed for public use under the terms of the Open Game License v1.0a. WALLS Typical Break Hit Climb Wall Type Thickness DC Hardness Points* DC --------- --------- --

          Add to Reading List

          Source URL: www.opengamingfoundation.org

          Language: English - Date: 2003-03-04 20:21:08
            26Low-end Uniform Hardness vs. Randomness Tradeoffs for AM Ronen Shaltiel ∗

            Low-end Uniform Hardness vs. Randomness Tradeoffs for AM Ronen Shaltiel ∗

            Add to Reading List

            Source URL: users.cms.caltech.edu

            Language: English - Date: 2007-03-22 14:10:23
              27Amplified Hardness of Approximation for VCG-Based Mechanisms Shaddin Dughmi Department of Computer Science Stanford University

              Amplified Hardness of Approximation for VCG-Based Mechanisms Shaddin Dughmi Department of Computer Science Stanford University

              Add to Reading List

              Source URL: www.fuhuthu.com

              Language: English - Date: 2014-05-21 16:31:02
                28On the Hardness of Approximating Spanners Guy Kortsarz  June 1, 1999

                On the Hardness of Approximating Spanners Guy Kortsarz  June 1, 1999

                Add to Reading List

                Source URL: crab.rutgers.edu

                - Date: 2010-10-08 18:15:06
                  29We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit

                  We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit

                  Add to Reading List

                  Source URL: vision.soic.indiana.edu

                  Language: English - Date: 2018-04-02 11:03:41
                    30Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms A. Hardness of V ITERBI PATH with small alphabet: Proof Throughout the proof, we set p = d Cε e and α = C

                    Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms A. Hardness of V ITERBI PATH with small alphabet: Proof Throughout the proof, we set p = d Cε e and α = C

                    Add to Reading List

                    Source URL: proceedings.mlr.press

                    - Date: 2018-02-06 15:06:57