6300 search results - page 138 / 1260 » We have it easy, but do we have it right |
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
112
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
109
click to vote
HCI
2007
15 years 2 months ago
2007
We present our current research on the implementation of gaze as an efficient and usable pointing modality supplementary to speech, for interacting with augmented objects in our da...
FAST
2003
15 years 2 months ago
2003
We show how untrusted computers can be used to facilitate secure mobile data access. We discuss a novel architecture, data staging, that improves the performance of distributed ...
120
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...