Abstract. In this paper, we test some of the most commonly used classifiers to identify which ones are the most robust to changing environments. The environment may change over tim...
Houman Abbasian, Chris Drummond, Nathalie Japkowic...
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
This paper presents a framework for image parsing with multiple label sets. For example, we may want to simultaneously label every image region according to its basiclevel object ...
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...