2996 search results - page 518 / 600 » Numberings and Randomness |
100
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
ISCC
2006
IEEE
2006
IEEE
Time-Critical Underwater Sensor Diffusion with No Proactive Exchanges and Negligible Reactive Floods
15 years 6 months ago
— In this paper we study multi-hop ad hoc routing in a scalable Underwater Sensor Network (UWSN), which is a novel network paradigm for ad hoc investigation of the world below th...
113
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
112
click to vote
MOBICOM
2005
ACM
15 years 5 months ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
ACNS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...