Sciweavers

1361 search results - page 165 / 273
» Spaces of practice
Sort
View
COMPGEOM
2009
ACM
15 years 11 months ago
k-means requires exponentially many iterations even in the plane
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....
Andrea Vattani
ICRA
1998
IEEE
126views Robotics» more  ICRA 1998»
15 years 10 months ago
Matrix Normalization for Optimal Robot Design
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...
Leo J. Stocco, S. E. Salcudean, F. Sassani
CORR
1999
Springer
116views Education» more  CORR 1999»
15 years 6 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
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...
CVPR
2011
IEEE
2153views Computer Vision» more  CVPR 2011»
15 years 2 months ago
The Light-Path Less Traveled
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, ...
DISOPT
2011
210views Education» more  DISOPT 2011»
15 years 1 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
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...
Stefan Szeider