500 search results - page 68 / 100 » Approximation algorithms for maximum independent set of pseu... |
ICDCS
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—To enable decentralised actions in very large distributed systems, it is often important to provide the nodes with global knowledge about the values of attributes across...
205
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
108
click to vote
LICS
2006
IEEE
15 years 7 months ago
2006
IEEE
Digital music players protect songs by enforcing licenses that convey specific rights for individual songs or groups of songs. For licenses specified in industry, we show that d...
ASPDAC
2006
ACM
15 years 7 months ago
2006
ACM
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
105
Voted
COMBINATORICA
2007
15 years 1 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...