The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
—Software logging is a conventional programming practice. While its efficacy is often important for users and developers to understand what have happened in the production run, ...
Feature selection plays a fundamental role in many pattern
recognition problems. However, most efforts have been
focused on the supervised scenario, while unsupervised feature
s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...