66 search results - page 10 / 14 » Finding bipartite subgraphs efficiently |
107
Voted
JMLR
2010
14 years 4 months ago
2010
We introduce a simple order-based greedy heuristic for learning discriminative structure within generative Bayesian network classifiers. We propose two methods for establishing an...
ACL
2006
14 years 11 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...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
CIKM
2010
Springer
14 years 4 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...