Tensority: an ASIC-friendly Proof of Work Algorithm Based on Tensor Bytom Foundation Email: April 17, 2018 Abstract

Source URL: bytom.io

• Search algorithms
• Statistical randomness
• Matrix
• Probability distribution
• Hash function
• Bitcoin
• Scrypt
• Random variable
• Information retrieval
• Information science
• Cryptography

Automatically Composing Representation Transformations as a Means for Generalization Michael Chang 1 Abhishek Gupta 1 Sergey Levine 1 Thomas L. Griffiths 1 Abstract

Source URL: arxiv.org

• Applied mathematics
• Mathematics
• Artificial intelligence
• Computational neuroscience
• Artificial neural networks
• Theoretical computer science
• Machine learning
• Cybernetics
• Deep learning
• Recurrent neural network
• Feature learning
• Recursion

PERIODS OF ALGEBRAIC VARIETIES OLIVIER DEBARRE Abstract. The periods of a compact complex algebraic manifold X are the integrals of its holomorphic 1-forms over paths. These integrals are in general not well-defined, but

Source URL: www.math.ens.fr

• Geometry
• Abstract algebra
• Algebra
• Algebraic geometry
• Hodge theory
• Projective variety
• Hodge structure
• K3 surface
• Elliptic curve
• Algebraic variety
• Khler manifold
• Differential forms on a Riemann surface

CURVES OF LOW DEGREES IN FANO VARIETIES OLIVIER DEBARRE Abstract. We work over the complex numbers. Fano manifolds are smooth projective varieties whose canonical bundle is antiample. In dimensions at most 3, they are al

Source URL: www.math.ens.fr

• Abstract algebra
• Algebra
• Geometry
• Algebraic geometry
• Fano variety
• Birational geometry
• Divisor
• Projective variety
• Coherent sheaf
• Hodge structure
• Cohomology
• Ample line bundle

What’s in Main Tobias Nipkow August 15, 2018 Abstract This document lists the main types, functions and syntax provided by theory Main. It is meant as a quick overview of what is available.

Source URL: www.cl.cam.ac.uk

Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis1 , Albert Oliveras1 , and Cesare Tinelli2 1 Technical University of Catalonia

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Formal methods
• Electronic design automation
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• DPLL
• Phase-locked loop
• Satisfiability

Time-memory Trade-offs for Near-collisions Ga¨etan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider o

Source URL: who.rocq.inria.fr

• Search algorithms
• Information retrieval
• Information science
• Cryptography
• Hashing
• Cryptographic hash functions
• Error detection and correction
• Hash function
• Hash table
• Hopf decomposition
• Compound of twelve pentagonal antiprisms with rotational freedom

An Evaluation of the Sieving Device YASD for 1024-bit Integers ? (Extended Abstract) Naoyuki Hirota1 , Tetsuya Izu2 , Noboru Kunihiro1 and Kazuo Ohta1 1

Source URL: www.hyperelliptic.org

• Cryptography
• Mathematics
• Weizmann Institute of Science
• Integer factorization algorithms
• Integer sequences
• TWINKLE
• Integer factorization
• TWIRL
• Prime number
• Dynamic random-access memory
• Factor base
• XTR

SWIFT: Predictive Fast Reroute Technical Report Thomas Holterbach∗† , Stefano Vissicchio‡ , Alberto Dainotti† , Laurent Vanbever∗ ∗ ETH Zürich, † CAIDA, UC San Diego, ‡ University College London ABSTRACT

Source URL: swift.ethz.ch

Three Bits Suffice: Explicit Support for Passive Measurement of Internet Latency in QUIC and TCP Piet De Vaere, Tobias Bühler, Mirja Kühlewind, and Brian Trammell ETH Zurich, Switzerland ABSTRACT

Source URL: nsg.romeier.ch

• Data transmission
• Computing
• Computer networking
• Network performance
• Internet protocols
• Information and communications technology
• QUIC
• Round-trip delay time
• Transmission Control Protocol
• Packet loss
• Transport layer
• Latency