9659 search results - page 127 / 1932 » Points on Computable Curves |
170
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
165
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
Pointing is a fundamental enabling operation for human-computer interaction across a broad spectrum of scenarios. The paper presents a study exploring how to develop a pointing sy...
196
click to vote
CCCG
2003
15 years 8 months ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
117
click to vote
JSC
2007
15 years 6 months ago
2007
We start the study of the problem of describing the double point locus of a bicubic surface. Our motivation is to determine, whether a real bicubic patch over the unit square will...