3008 search results - page 559 / 602 » Independence in connected graphs |
144
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
164
click to vote
SOSP
2001
ACM
16 years 3 months ago
2001
ACM
We have developed a new approach for reliably multicasting timecritical data to heterogeneous clients over mesh-based overlay networks. To facilitate intelligent content pruning, ...
163
click to vote
SI3D
2010
ACM
16 years 1 months ago
2010
ACM
Volume caustics are intricate illumination patterns formed by light first interacting with a specular surface and subsequently being scattered inside a participating medium. Alth...
172
click to vote
ICNP
2009
IEEE
16 years 28 days ago
2009
IEEE
— Millions of residential users are widely served by cable or DSL connections with modest upload bandwidth and relatively high download bandwidth. For the increasingly important ...
160
click to vote
IWCMC
2009
ACM
16 years 24 days ago
2009
ACM
This paper proposes a dynamic trust establishment protocol that enables the nodes of an ad hoc network to establish security associations among each other in a distributed and pee...