815 search results - page 151 / 163 » Approximate Entropy Reducts |
JSAC
2007
14 years 9 months ago
2007
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
SIAMMAX
2010
14 years 4 months ago
2010
It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coeff...
SODA
2012
ACM
12 years 12 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
125
click to vote
ECCC
2007
14 years 9 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...