In text management tasks, the dimensionality reduction becomes necessary to computation and interpretability of the results generated by machine learning algorithms. This paper de...
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
Abstract. In this paper we present an efficient technique to obtain accurate semantic classification on the pixel level capable of integrating various modalities, such as color, ed...
Stefan Kluckner, Thomas Mauthner, Peter M. Roth, H...
In this paper we present a framework for semantic scene parsing and object recognition based on dense depth maps. Five viewindependent 3D features that vary with object class are e...
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...