100 search results - page 19 / 20 » Upper Bounds for Vertex Cover Further Improved |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
TR
2008
13 years 7 months ago
2008
Shared Segment Protection (SSP), compared with Shared Path Protection (SPP), and Shared Link Protection (SLP), provides an optimal protection configuration due to the ability of ma...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...