A Generalized Language Model as the Combination of Skipped n-grams and Modified Kneser-Ney Smoothing Rene Pickhardt, Thomas Gottron, Martin K¨orner, Steffen Staab Institute for Web Science and Technologies, University o

Source URL: acl2014.org

Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Source URL: page.math.tu-berlin.de

• Graph theory
• Kneser graph
• Petersen graph
• Odd graph
• Hamiltonian path
• Graph
• Cycle
• Planar graphs
• Desargues graph
• Polyhedral graph

Assignment 5 L645 / B659 Due Monday, October 12 I’m going to suggest groups of 2–3 people to work on this assignment. It’s not quite as involved as the Stanford CoreNLP one, but still has some technical start-up ti

Source URL: cl.indiana.edu

• Time series analysis
• KneserNey smoothing
• Signal processing
• Language model
• Kneser
• Smoothing
• Levenshtein distance

Comment. Math. Helvetici + Birkh~iuser Verlag, Basel Counterexamples to the Kneser conjecture in dimension four

Source URL: people.mpim-bonn.mpg.de

• Surgery theory
• Algebraic topology
• Cobordism
• Differential topology
• Diffeomorphism
• Fundamental group
• Differentiable manifold
• Cohomology

“Stable Prime Decompositions of Four-Manifolds” by Matthias Kreck, Wolfgang L¨uck and Peter Teichner Abstract: The main result of this paper is a four-dimensional stable version of Kneser’s conjecture on the split

Source URL: people.mpim-bonn.mpg.de

• Surgery theory
• Differential topology
• Geometric topology
• Manifolds
• Algebraic topology
• Diffeomorphism
• Cobordism
• Differentiable manifold
• Classification of manifolds
• 3-manifold
• Connected sum
• Topological manifold

Kneser-Ney Smoothing on Expected Counts Hui Zhang Department of Computer Science University of Southern California

Source URL: www3.nd.edu

On the weighted Kneser-Poulsen conjecture ∗ K. Bezdek †(Univ. of Calgary) and R. Connelly ‡(Cornell Univ.)

Source URL: www.math.cornell.edu

Optimal real number graph labelings of a subfamily of Kneser graphs∗ Rok Erman† Suzana Jureˇciˇc† Daniel Kr´al’‡ Kris Stopar†

Source URL: iti.mff.cuni.cz

Journal de Th´eorie des Nombres de Bordeaux), 125–130 On some subgroup chains related to Kneser’s theorem ´

Source URL: almira.math.u-bordeaux.fr

Kneser-Poulsen conjecture for large radii Igors Gorbovickis June 1, 2009 Abstract In this paper we prove the Kneser-Poulsen conjecture for large radii. Namely, if a finite number of points in Euclidean space E n is rearr

Source URL: www.cs.elte.hu