51 search results - page 5 / 11 » Dependent Rounding in Bipartite Graphs |
SRDS
2010
IEEE
13 years 6 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...
ADHOCNOW
2008
Springer
14 years 3 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
ICPR
2010
IEEE
14 years 27 days ago
2010
IEEE
Semantic analysis of a document collection can be viewed as an unsupervised clustering of the constituent words and documents around hidden or latent concepts. This has shown to i...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
NOMS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...