THE f (q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS KATHRIN BRINGMANN AND KEN ONO Abstract. In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtai

Source URL: www.mathcs.emory.edu

Confronting the Partition Function Lecture slides for Chapter 18 of Deep Learning www.deeplearningbook.org Ian Goodfellow Last updated

Source URL: www.deeplearningbook.org

Chern-Simons theory The C-S partition function Feynman calculus gives a perturbation expansion of Z near the flat connections in 1/k. The interaction

Source URL: www.math.uni-hamburg.de

Several problems in applied mathematics and statistics require integrating a function f over a high-dimensional domain. For example, estimating the partition function of a graphical model for a fixed set of parameters re

Source URL: mmds-data.org

The Partition Technique for Overlays of Envelopes∗ Vladlen Koltun† Micha Sharir‡ Abstract

Source URL: www.math.tau.ac.il

• Mathematics
• Analysis of algorithms
• Discrete mathematics
• Number theory
• Mathematical analysis
• Combinatorics
• Partition
• Time complexity
• E-function
• Big O notation

Asymptotic formulæ in combinatory analysis∗ Proceedings of the London Mathematical Society, 2, XVII, 1918, 75 — Introduction and summary of results 1.1 The present paper is the outcome of an attempt to apply

Source URL: ramanujan.sirinudi.org

• Mathematical analysis
• Mathematics
• Asymptotic analysis
• Arithmetic functions
• Analytic functions
• Meromorphic functions
• Combinatorics
• Partition
• Prime number theorem
• Asymptotic formula
• Divisor function
• Riemann zeta function

Overview of Generating Functions October 26, 2015 A function associated to a sequence a0 , a1 , a2 , . . . Two Types 1. Ordinary generating functions

Source URL: math.colorado.edu

• Mathematics
• Mathematical analysis
• Discrete mathematics
• Combinatorics
• Integer sequences
• Generating function
• Partition
• Polynomials
• Exponential function
• Sequence
• Enumerative combinatorics
• Examples of generating functions

An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt

Source URL: mmds-data.org

• Submodular set function
• Reduction
• Economic model
• Algorithm
• Mathematics
• Mathematical optimization
• Cognitive science
• Theoretical computer science

Hybrid Use of Hashing Techniques for Spatial Data Wayne A. Davis Department of Computing Science The University of Alberta Edmonton, Alberta, Canada T6G 2H1

Source URL: mapcontext.com

• Information retrieval
• Information science
• Search algorithms
• Hashing
• Extendible hashing
• Hash table
• Linear hashing
• Hash function
• Hash
• Double hashing
• Cryptographic hash function
• Partition

Load Balancing for MapReduce-based Entity Resolution Lars Kolb, Andreas Thor, Erhard Rahm Database Group, University of Leipzig Leipzig, Germany {kolb,thor,rahm}@informatik.uni-leipzig.de

Source URL: dbs.uni-leipzig.de

• Computing
• Parallel computing
• MapReduce
• Data-intensive computing
• Data
• Record linkage
• Partition
• Replication
• Hash function