Sciweavers

3145 search results - page 561 / 629
» Algebraic Linear Orderings
Sort
View
102
Voted
JCT
2010
114views more  JCT 2010»
14 years 11 months ago
An almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Andrzej Dudek, Vojtech Rödl
122
Voted
JMLR
2010
155views more  JMLR 2010»
14 years 11 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
111
Voted
MST
2010
78views more  MST 2010»
14 years 11 months ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich
PVLDB
2010
103views more  PVLDB 2010»
14 years 11 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
108
Voted
SIAMDM
2010
128views more  SIAMDM 2010»
14 years 11 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...