Sciweavers

3204 search results - page 220 / 641
» The b-chromatic Number of a Graph
Sort
View
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
15 years 21 days ago
The Induced Subgraph Order on Unlabelled Graphs
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
Craig A. Sloss
94
Voted
ACL
2010
14 years 10 months ago
Learning Lexicalized Reordering Models from Reordering Graphs
Lexicalized reordering models play a crucial role in phrase-based translation systems. They are usually learned from the word-aligned bilingual corpus by examining the reordering ...
Jinsong Su, Yang Liu, Yajuan Lü, Haitao Mi, Q...
ICASSP
2011
IEEE
14 years 4 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
JCT
2007
107views more  JCT 2007»
15 years 16 days ago
On a conjecture of Wilf
Abstract. Let n and k be natural numbers and let S(n, k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum nX j=0 (−1)j S(n, j) ...
Stefan De Wannemacker, Thomas Laffey, Robert Osbur...
COCOA
2007
Springer
15 years 6 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...