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...
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
We propose a fast approach to 3?D object detection and pose estimation that owes its robustness to a training phase during which the target object slowly moves with respect to the ...