We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...
The majority of existing tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework using a Hidden Markov Model, where the distribution ...
Recent research in compositional real-time systems has focused on determination of a component’s real-time interface parameters. An important objective in interface-parameter de...