4761 search results - page 232 / 953 » Generalizing Boundary Points |
193
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
162
click to vote
EUROCRYPT
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
131
click to vote
COMPUTING
2007
15 years 5 months ago
2007
We consider a parameterized family of closed planar curves and introduce an evolution process for identifying a member of the family that approximates a given unorganized point cl...
181
click to vote
AI
2011
Springer
15 years 25 days ago
2011
Springer
In this paper we present a general framework for the comparison of intervals when preference relations have to established. The use of intervals in order to take into account impr...
142
click to vote
AMOST
2005
ACM
15 years 11 months ago
2005
ACM
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal prog...