34 search results - page 5 / 7 » On the Extension of Bipartite to Parity Graphs |
SRDS
2010
IEEE
13 years 5 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...
ICALP
2010
Springer
14 years 6 days ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
ACL
2006
13 years 8 months ago
2006
Given a parallel corpus, semantic projection attempts to transfer semantic role annotations from one language to another, typically by exploiting word alignments. In this paper, w...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
NOMS
2002
IEEE
14 years 10 days 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...