2498 search results - page 70 / 500 » Data Structures with Unpredictable Timing |
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We present a robust radiometric calibration method that capitalizes on the transform invariant low-rank structure of sensor irradiances recorded from a static scene with different...
CLUSTER
2006
IEEE
14 years 9 months ago
2006
IEEE
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
IPL
2007
14 years 9 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
ESA
2003
Springer
15 years 3 months ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
EURODAC
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper describes a method to optimize the performance of data paths. It is based on bit-level arithmetic transformations, and is especially suited to optimize large adder stru...