494 search results - page 47 / 99 » Heap Building Bounds |
104
click to vote
CRYPTO
2010
Springer
14 years 7 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
TVCG
2011
14 years 6 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
112
click to vote
MOC
2010
14 years 5 months ago
2010
We study H(div) preconditioning for the saddle-point systems that arise in a stochastic Galerkin mixed formulation of the steady-state diffusion problem with random data. The key i...
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
We present a method for reconstructing a trajectory of an object moving in front of non-overlapping fully or partially calibrated cameras. The non-overlapping setup turns that pro...
MOBICOM
2005
ACM
15 years 4 months ago
2005
ACM
— This paper studies how the capacity of a static multi-channel network scales as the number of nodes, n, increases. Gupta and Kumar have determined the capacity of single-channe...