390 search results - page 66 / 78 » Computing shortest paths for any number of hops |
115
click to vote
CCS
2009
ACM
16 years 9 days ago
2009
ACM
The man-in-the-middle (MITM) attack has been shown to be one of the most serious threats to the security and trust of existing VoIP protocols and systems. For example, the MITM wh...
SODA
2010
ACM
15 years 9 months 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...
114
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
DAC
2008
ACM
16 years 21 days ago
2008
ACM
Since process and environmental variations can no longer be ignored in high-performance microprocessor designs, it is necessary to develop techniques for computing the sensitiviti...
103
click to vote
SENSYS
2004
ACM
15 years 5 months ago
2004
ACM
Network congestion occurs when offered traffic load exceeds available capacity at any point in a network. In wireless sensor networks, congestion causes overall channel quality t...