Sciweavers

1380 search results - page 226 / 276
» A General Polynomial Sieve
Sort
View
JCT
2010
114views more  JCT 2010»
13 years 7 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
JUCS
2010
106views more  JUCS 2010»
13 years 7 months ago
A Heuristic Approach to Positive Root Isolation for Multiple Power Sums
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
Ming Xu, Chuandong Mu, Zhenbing Zeng, Zhi-bin Li
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
13 years 7 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
MST
2010
78views more  MST 2010»
13 years 7 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
TALG
2010
110views more  TALG 2010»
13 years 7 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx