Search Results

Results for “1”


Single Event Effect Assessment of a 1-Mbit Commercial MRAM

Single event effect susceptibility of a 1-Mbit commercial MRAM was experimentally evaluated. The memory exhibited SEFIs when operated in a dynamic mode with an LET threshold of 2.29 MeV.cm2/mg and a saturated cross section of 2.2x10-4 cm2/device. The memory was not sensitive to SEL, SEU or MBUs.

Video thumbnail of Field Guide to Machine Learning, Lesson 1: Problem Definition

Field Guide to Machine Learning, Lesson 1: Problem Definition

<palette xmlns:wordpress-post-id="8132" xmlns:wordpress-post-publish-timestamp="1525699416" xmlns:wordpress-post-modified-timestamp="1633439858" xmlns:mcr-ent="palette-mc-research-entity-toolkit" xmlns:mcr="palette-mc-research-toolkit" xmlns:meta-props="meta-props-toolkit" xmlns:meta-config-toolkit="meta-config-toolkit">...


12-in-1: Multi-Task Vision and Language Representation Learning

Much of vision-and-language research focuses on a small but diverse set of independent tasks and supporting datasets often studied in isolation; however, the visually grounded language understanding skills required for success at these tasks overlap significantly. In this work, we investigate these relationships between vision-and-language tasks by developing a large-scale, multi-task training regime


Efficient, arbitrarily high precision hardware logarithmic arithmetic for linear algebra

The logarithmic number system (LNS) is arguably not broadly used due to exponential circuit overheads for summation tables relative to arithmetic precision. Methods to reduce this overhead have been proposed, yet still yield designs with high chip area and power requirements. Use remains limited to lower precision or high multiply/add ratio cases, while much of linear algebra (near 1:1 multiply/add ratio) does not qualify. We present a dual-base approximate logarithmic arithmetic comparable to floating point in use, yet unlike LNS it is easily fully pipelined, extendable to arbitrary precision with O(n^2) overhead, and energy efficient at a 1:1 multiply/add ratio.


Robust Estimation for Random Graphs

We study the problem of robustly estimating the parameter p of an Erdős-Rényi random graph on n nodes, where a γ fraction of nodes may be adversarially corrupted.