Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Web pages are more than text and they contain much contextual and structural information, e.g., the title, the meta data, the anchor text, etc., each of which can be seen as a dat...
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...
A learning problem might have several measures of complexity (e.g., norm and dimensionality) that affect the generalization error. What is the interaction between these complexiti...
We address classification problems for which the training instances are governed by a distribution that is allowed to differ arbitrarily from the test distribution--problems also ...