2168 search results - page 305 / 434 » Randomized Algorithms and Complexity Theory |
120
Voted
SODA
2010
ACM
16 years 23 days ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
118
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
106
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulne...
160
click to vote
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
161
click to vote
PODS
1995
ACM
15 years 7 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...