51692 search results - page 9983 / 10339 » at 2008 |
216
Voted
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
193
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
169
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
181
Voted
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—With the proliferation of wireless multimedia applications, multicast/broadcast has been recognized as an efficient technique to transmit a large volume of data to mult...
187
Voted
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. M...