1941 search results - page 36 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
108
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
ANOR
2010
15 years 24 days ago
2010
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
100
Voted
IWCMC
2009
ACM
15 years 7 months ago
2009
ACM
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
107
Voted
WG
2001
Springer
15 years 5 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...