Sciweavers

256 search results - page 6 / 52
» Root shadow spaces
Sort
View
CGO
2010
IEEE
13 years 12 months ago
Umbra: efficient and scalable memory shadowing
Shadow value tools use metadata to track properties of application data at the granularity of individual machine instructions. These tools provide effective means of monitoring an...
Qin Zhao, Derek Bruening, Saman P. Amarasinghe
GRAPHICSINTERFACE
2008
13 years 9 months ago
Quality scalability of soft shadow mapping
Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately det...
Michael Schwarz, Marc Stamminger
SSS
2005
Springer
14 years 1 months ago
A Snap-Stabilizing DFS with a Lower Space Requirement
Abstract. A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stab...
Alain Cournier, Stéphane Devismes, Vincent ...
DCC
2008
IEEE
14 years 7 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth
DM
2008
117views more  DM 2008»
13 years 7 months ago
Classes of optical orthogonal codes from arcs in root subspaces
We present new constructions for (n, w, ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q - 1)-arcs contain...
T. L. Alderson, Keith E. Mellinger