A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Filters
Local List Recovery of High-rate Tensor Codes and Applications
[article]
2017
arXiv
pre-print
Instantiating this with known constructions of high-rate globally list-recoverable codes and high-rate locally decodable codes finishes the construction. ...
In this work, we give the first construction of high-rate locally list-recoverable codes. ...
The second author would like to thank Swastik Kopparty for raising the question of obtaining capacity achieving locally list decodable codes which was a direct trigger for this work as well as previous ...
arXiv:1706.03383v1
fatcat:uzkqy327czg3thr3eg7nebgjyy
On List Recovery of High-Rate Tensor Codes
2020
IEEE Transactions on Information Theory
We continue the study of list recovery properties of high-rate tensor codes, initiated by Hemenway, and Wootters (FOCS'17). ...
This bound implies in turn a nearly-tight lower bound of N Ω(1/ log log N ) on the product of query complexity and output list size for locally list recovering high-rate tensor codes. ...
Theorem 4 (Local list recovery of high-rate tensor codes). The following holds for any δ, α > 0, and s = poly(1/δ, 1/α). ...
doi:10.1109/tit.2020.3023962
fatcat:myxnubyhkbdeblp52asmjq3d5q
Improved decoding of Folded Reed-Solomon and Multiplicity Codes
[article]
2018
arXiv
pre-print
Folded Reed-Solomon codes were the first explicit constructions of codes known to achieve list-decoding capacity; multivariate multiplicity codes were the first constructions of high-rate locally correctable ...
Using our result on univariate multiplicity codes, we show that multivariate multiplicity codes are high-rate, locally list-recoverable codes. ...
Acknowledgements We would like to thank Atri Rudra and Venkatesan Guruswami for helpful discussions. ...
arXiv:1805.01498v1
fatcat:7nuc5xduhfd3hfuzokpj6544za
Branching MERA codes: A natural extension of classical and quantum polar codes
2014
2014 IEEE International Symposium on Information Theory
We introduce a new class of circuits for constructing efficiently decodable quantum and classical error-correction codes, based on a recently discovered contractible tensor network known as branching multi-scale ...
We perform an in-depth study of a particular example that can be thought of as an extension to Arikan's polar code [2]-[4]. ...
DP would like to acknowledge support from NSERC and FQRNT through the network INTRIQ. Computational resources were provided by Compute Canada and Calcul Québec. ...
doi:10.1109/isit.2014.6874999
dblp:conf/isit/FerrisP14
fatcat:bvi3ip55rngrfbkpxtlx7cvvoy
Using synchrotron radiation to improve understanding of deformation of polycrystalline metals by measuring, modelling and publishing 4D information
2019
IOP Conference Series: Materials Science and Engineering
The evolution of deformation in a Mg-Nd alloy has been investigated using 3D HEDM and crystal plasticity simulation using the PRISMS-Plasticity CPFE Code. ...
The results of these HEDM experiments and PRISMS-Plasticity simulations have been stored in the Materials Commons in a straight-forward manner and are being made available as a published dataset. ...
Department of Energy, Office of Basic Energy Sciences, Division of Materals Sciences and Engineering under Award #DE-SC0008637 as part of the Center for PRedictive Integrated Structural Materials Science ...
doi:10.1088/1757-899x/580/1/012017
fatcat:yjjr6zl2ubgklfimdlgfb22o4a
A Big-Data Approach to Handle Many Process Variations: Tensor Recovery and Applications
[article]
2016
arXiv
pre-print
This idea is formulated as a tensor recovery problem with sparse and low-rank constraints; and it is solved with an alternating minimization approach. ...
of a high-dimensional data array. ...
Tensor and Tensor Decomposition 1) Tensor: Tensor is a high-dimensional generalization of matrix. ...
arXiv:1611.02256v1
fatcat:4oxoayrcwne7fezuhpa63kmcei
Extending stability beyond CPU millennium
2007
Proceedings of the 2007 ACM/IEEE conference on Supercomputing - SC '07
scalability, and improve overall application performance. ...
The advances are in three key areas for massively parallel computation such as on BlueGene/L (BG/L): fault tolerance, application kernel optimization, and distribution across the parallel architecture. ...
We are currently pursuing strategies to optimize the organization of the neighbor list. As was mentioned above, forstress has additional code for computing the stress tensor. ...
doi:10.1145/1362622.1362700
dblp:conf/sc/GlosliRCRGS07
fatcat:kv7n4nxehraahds6ihlhcafsz4
Tensor-Factorization-Based 3d Single Image Super-Resolution with Semi-Blind Point Spread Function Estimation
2019
2019 IEEE International Conference on Image Processing (ICIP)
In this work a joint alternating recovery of the high-resolution image and of the unknown point spread function parameters is proposed. The method is evaluated on dental computed tomography images. ...
That method allowed a 2-order-of-magnitude faster high-resolution image reconstruction with equivalent image quality compared to state-of-the-art algorithms. ...
METHODS
Problem formulation The classical image degradation model of SISR defines the LR image ( Y ∈ R I/r1×J/r2×K/r3 ) as a downsampled (with rate r 1 = r 2 = r 3 = r in our application) and blurred ...
doi:10.1109/icip.2019.8803354
dblp:conf/icip/HatvaniBMGK19
fatcat:kcwxekadqjhqblrzizvsvwps7u
Finally, the data is dynamic; structural changes can occur at multiple time scales and be localized to a subset of users. ...
We show that, through the use of randomized tensor ensembles, SCENT is able to encode the observed tensor streams in the form of compact descriptors. ...
ACKNOWLEDGMENTS We thank Jimeng Sun for providing us with the DTA source code, Nan Cao for helping prepare the DBLP dataset, and Mahsa Mojtahedi for the help with the experiment resources. ...
doi:10.1145/2037676.2037686
fatcat:4b25ljdh6rbztjmorizls3r4ju
WTEN: An Advanced Coupled Tensor Factorization Strategy for Learning from Imbalanced Data
[chapter]
2016
Lecture Notes in Computer Science
Learning from imbalanced and sparse data in multi-mode and high-dimensional tensor formats efficiently is a significant problem in data mining research. ...
Importantly, we have also investigated the implication of joint analysis of the main tensor and extra information. ...
to different datasets and applications. ...
doi:10.1007/978-3-319-48740-3_40
fatcat:6hiycfo66bfolkcoqk57mvxx54
Experimental Findings on the Sources of Detected Unrecoverable Errors in GPUs
[article]
2021
arXiv
pre-print
We investigate the sources of Detected Unrecoverable Errors (DUEs) in GPUs exposed to neutron beams. Illegal memory accesses and interface errors are among the more likely sources of DUEs. ...
Our test procedure has shown that ECC can reduce the DUEs caused by Illegal Address access up to 92% for Kepler and 98% for Volta. ...
Tested Codes: We chose the eight representative codes listed in Table I , from HPC and deep learning domains. ...
arXiv:2108.00554v1
fatcat:j3q2aqqyzffstdnd7j4i3ndk44
FE modelling of small punch creep test using Kocks-Mecking-Estrin model
2018
Ubiquity Proceedings
Acknowledgements: The first author would like to take this opportunity to thank the Ministry of Higher Education and Scientific Research/ Iraq for their financial support to his PhD research at the University ...
of Nottingham. ...
rate, ℕ ij is the flow direction tensor, and S ij denotes the deviatoric stress tensor, while the quantities in Equation (18)
The UMAT Coding and Implementation The FE software ABAQUS permits the ...
doi:10.5334/uproc.3
fatcat:ctrcvrey3ra7nae3k2eykdjjnm
Diffusion Tensor Imaging
2003
Current Protocols in Magnetic Resonance Imaging
With the ongoing research and development, the scope of DTI applications is expected to expand in the future. ...
The intensity of each color-coded pixel denotes the amplitude of the selected diffusion anisotropy index. ...
Norman Leeds, Jeffrey Weinberg, Christof Karmonik, and Bryan Mock for helpful discussions.
Literature Cited ...
doi:10.1002/0471142719.mia0604s11
fatcat:cjvan7tyjjcizhadfhwoffnvnm
Extending TensorFlow's Semantics with Pipelined Execution
[article]
2019
arXiv
pre-print
This results in a sustained genome alignment and sorting rate of 321 megabases/second, using the compute and I/O resources of 20 computers. ...
TensorFlow's native runtime executes the application with low overhead across a diverse set of hardware including CPUs, GPUs, and ASICs. ...
The I/O rate shown in Figure 7b shows the aggregate I/O rate measured at the NIC; the aggregate is computed across all local pipelines of the same type. ...
arXiv:1908.09291v1
fatcat:fvby5lysrreitec4gfyrfdfxlu
Approximate Bacon-Shor code and holography
2021
Journal of High Energy Physics
This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the ...
The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. ...
, where the application of gates is directly related to spatially local tensor moves. ...
doi:10.1007/jhep05(2021)127
fatcat:afgrjjfqejcybp7zury4jpinqy
« Previous
Showing results 1 — 15 out of 6,971 results