553 search results - page 68 / 111 » Cover Contact Graphs |
SRDS
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
APPROX
2008
Springer
15 years 11 days ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
91
Voted
MOBIHOC
2008
ACM
15 years 10 months ago
2008
ACM
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
106
click to vote
ESWA
2008
14 years 10 months ago
2008
The severe competition in the market has driven enterprises to produce a wider variety of products to meet consumers' needs. However, frequent variation of product specificat...
66
Voted
TIT
2010
14 years 5 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...