100 search results - page 17 / 20 » Upper Bounds for Vertex Cover Further Improved |
COMCOM
2004
13 years 7 months ago
2004
Bandwidth-delay product (BDP) and its upper bound (BDP-UB) have been well-understood in wireline networks such as the Internet. However, they have not been carefully studied in th...
COCOON
2003
Springer
14 years 19 days ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
INFOCOM
2011
IEEE
12 years 10 months ago
2011
IEEE
—In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tol...