The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Good robot performance often relies upon the selection of design parameters that lead to a well conditioned Jacobian or impedance "design" matrix. In this paper, a new d...
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
This paper extends classical object pose and relative camera motion estimation algorithms for imaging sensors sampling the scene through light-paths. Many algorithms in multi-view...
Srikumar Ramalingam, Sofien Bouaziz, Peter Sturm, ...
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...