THEOREM OF THE DAY Fisher’s Inequality If a balanced incomplete block design is specified with parameters (v, b, r, k, λ) then v ≤ b. In a balanced incomplete block design, or BIBD, a set of v treatments are selec

Source URL: www.theoremoftheday.org

On k-Enclosing Objects in a Coloured Point Set Luis Barba∗ Stephane Durocher†‡ Debajyoti Mondal†

Source URL: www.cs.umanitoba.ca

1 Under consideration for publication in Theory and Practice of Logic Programming claspfolio 2: Advances in Algorithm Selection for Answer Set Programming

Source URL: www.cs.uni-potsdam.de

• Machine learning
• Algorithm Selection
• Answer set programming
• Solver
• Feature selection
• Algorithm
• K-nearest neighbors algorithm
• K-means clustering
• Problem solving
• Branch and bound

Constant-factor approximation of domination number in sparse graphs Zdenˇek Dvoˇra´ k∗ Abstract The k-domination number of a graph is the minimum size of a set X such

Source URL: iti.mff.cuni.cz

Schrijfkriebels? Ontdek onze heerlijke set postkaarten. 10 euro/set van 13 Bestellen bij Kind & Samenleving, 

Source URL: k-s.be

Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = Fq be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that the set of lines L

Source URL: math.harvard.edu

CUSTOM ORDER FORM MY16 Brompton Bicycle Ltd., Unit 1, Greenford Park, Ockham Drive, Greenford, Middlesex UB6 0FD 4. The front luggage set s come complete with front carrier bloc k and frame to attach the luggage to the

Source URL: www.calhouncycle.com

Satisfiability Coding Lemma Ramamohan Paturit, Pave1 Pud1d.k: and Francis Zanet Abstract property, the Satisfiability Coding Lemma, of the set of

Source URL: cseweb.ucsd.edu

ON THE DEFINITION AND K-THEORY REALIZATION OF A MODULAR FUNCTOR IGOR KRIZ AND LUHANG LAI Abstract. We present a definition of a (super)-modular functor

Source URL: www.math.lsa.umich.edu

• Category theory
• Functors
• Algebraic topology
• Monoidal categories
• Nerve
• Enriched category
• Topological quantum field theory
• Sheaf
• Equivalence of categories
• Natural transformation
• Universal property
• Simplicial set

On the chromatic number of digraphs Ararat Harutyunyan (University of Oxford) The dichromatic number of a digraph D is the smallest k such that the vertex set of D can be partitioned into k sets each of which induces an

Source URL: web.mat.bham.ac.uk