Sciweavers

727 search results - page 81 / 146
» One line and n points
Sort
View
COMPGEOM
2007
ACM
14 years 12 months ago
Between umbra and penumbra
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...
Julien Demouth, Olivier Devillers, Hazel Everett, ...
DC
2010
14 years 5 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab
ISQED
2008
IEEE
142views Hardware» more  ISQED 2008»
15 years 4 months ago
Clock Skew Analysis via Vector Fitting in Frequency Domain
An efficient frequency-based clock analysis method: CSAV is proposed in this paper. It computes the circuit response by first solving the state equation in frequency domain, and...
Ling Zhang, Wenjian Yu, Haikun Zhu, Wanping Zhang,...
SP
1999
IEEE
155views Security Privacy» more  SP 1999»
15 years 2 months ago
Software Smart Cards via Cryptographic Camouflage
A sensitive point in public key cryptography is how to protect the private key. We outline a method of protecting private keys using cryptographic camouflage. Specifically, we do ...
Douglas N. Hoover, B. N. Kausik
ESA
2007
Springer
81views Algorithms» more  ESA 2007»
15 years 4 months ago
Farthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
Otfried Cheong, Hazel Everett, Marc Glisse, Joachi...