Sciweavers

434 search results - page 27 / 87
» sum 2007
Sort
View
ACL
2003
13 years 9 months ago
Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data
This paper proposes the “Hierarchical Directed Acyclic Graph (HDAG) Kernel” for structured natural language data. The HDAG Kernel directly accepts several levels of both chunk...
Jun Suzuki, Tsutomu Hirao, Yutaka Sasaki, Eisaku M...
ARSCOM
2007
81views more  ARSCOM 2007»
13 years 7 months ago
Graphic Sequences with a Realization Containing a Friendship Graph
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
Michael Ferrara, Ronald J. Gould, John R. Schmitt
EJC
2010
13 years 7 months ago
Inversion of some series of free quasi-symmetric functions
We give a combinatorial formula for the inverses of the alternating sums of free quasi-symmetric functions of the form F(I) where I runs over compositions with parts in a prescribe...
Florent Hivert, Jean-Christophe Novelli, Jean-Yves...
EJC
2007
13 years 7 months ago
On the sign-imbalance of skew partition shapes
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is ...
Jonas Sjöstrand
IPL
2007
114views more  IPL 2007»
13 years 7 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...