2681 search results - page 109 / 537 » Problem F |
ISSAC
2005
Springer
14 years 3 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
JACM
2000
13 years 10 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
RAS
2010
13 years 8 months ago
2010
This paper presents a model of ocular-motor development, inspired by ideas and data from developmental psychology. The learning problem concerns the growth of the transform betwee...
JSAC
2006
13 years 10 months ago
2006
In this paper, we investigate the timing acquisition problem for transmitted reference (TR) ultra-wideband systems employing direct-sequence (DS) spreading. We show that a two-leve...
MM
2005
ACM
14 years 3 months ago
2005
ACM
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...