66 search results - page 10 / 14 » Finding bipartite subgraphs efficiently |
163
click to vote
JMLR
2010
14 years 10 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...
124
Voted
ACL
2006
15 years 5 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...
141
click to vote
ICALP
2009
Springer
16 years 3 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...
151
Voted
CVPR
2010
IEEE
15 years 12 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...
149
Voted
CIKM
2010
Springer
14 years 10 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...