We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
The popular bag-of-features representation for object recognition collects signatures of local image patches and discards spatial information. Some have recently attempted to at l...