To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
The stability domain is a feasible set for numerous optimization problems. D-decomposition technique is targeted to describe the stability domain in the parameter space for linear...
It is difficult to design and test location-enhanced applications. A large part of this difficulty is due to the added complexity of supporting location. Wizard of Oz (WOz) has be...
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
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...