1040 search results - page 126 / 208 » Rounding algorithms for covering problems |
CDC
2008
IEEE
14 years 12 months ago
2008
IEEE
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
CCS
2008
ACM
14 years 12 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
NIPS
2007
14 years 11 months ago
2007
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
PODC
2011
ACM
14 years 20 days ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...