[go: up one dir, main page]

Neylon, 2006 - Google Patents

Sparse solutions for linear prediction problems

Neylon, 2006

View PDF
Document ID
4882637633769622179
Author
Neylon T
Publication year

External Links

Snippet

Sparse solutions for linear prediction problems Sparse solutions for linear prediction problems Abstract The simplicity of an idea has long been regarded as a sign of elegance and, when shown to coincide with accuracy, a hallmark of profundity. In this thesis our ideas are vectors …
Continue reading at tylerneylon.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run

Similar Documents

Publication Publication Date Title
Iverson et al. Coherence in logical quantum channels
Cheraghchi et al. Non-malleable coding against bit-wise and split-state tampering
García et al. On the geometry of stabilizer states
Kerenidis et al. Exponential lower bound for 2-query locally decodable codes via a quantum argument
Gaborit et al. On the complexity of the rank syndrome decoding problem
Albrecht et al. On bounded distance decoding with predicate: Breaking the “lattice barrier” for the hidden number problem
D’Anvers et al. The impact of error dependencies on Ring/Mod-LWE/LWR based schemes
Iyer et al. A small quantum computer is needed to optimize fault-tolerant protocols
Alicki et al. A statistical mechanics view on Kitaev's proposal for quantum memories
Chi et al. Lattice based cryptography for beginners
Neylon Sparse solutions for linear prediction problems
Brun Quantum error correction
Knill Protected realizations of quantum information
Turin Performance Analysis and modeling of digital transmission systems
Johnson et al. An analysis of error reconciliation protocols used in quantum key distribution systems
Chandra et al. Quantum coding bounds and a closed-form approximation of the minimum distance versus quantum coding rate
van Poppelen Cryptographic decoding of the Leech lattice
You et al. Single-trace fragment template attack on a 32-bit implementation of keccak
Paterson et al. A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
Viamontes et al. Graph-based simulation of quantum computation in the density matrix representation
Anthapadmanabhan et al. Update-efficient codes for erasure correction
Albrecht Alorithmic algebraic techniques and their application to block cipher cryptanalysis
Jerkovits et al. An Error-Code Perspective on Metzner--Kapturowski-like Decoders
Levy-dit-Vehel et al. A framework for the design of secure and efficient proofs of retrievability
Fletcher Channel-adapted quantum error correction