Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
We report on the results of a user study to investigate the utility of passive haptics for eyes-free numeric entry. This work targets cursorless user interfaces designed for use w...
Poor performance on numerical codes has slowed the adoption of Java within the technical computing community. In this paper we describe a prototype array library and a research pr...
Pedro V. Artigas, Manish Gupta, Samuel P. Midkiff,...
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
Danny Bickson, Danny Dolev, Genia Bezman, Benny Pi...
An exact analysis of the numerical errors being generated during the computation of the Zernike moments, by using the well-known `q-recursive' method, is attempted in this pa...
George A. Papakostas, Yiannis S. Boutalis, Constan...