2168 search results - page 145 / 434 » Randomized Algorithms and Complexity Theory |
102
Voted
DRM
2007
Springer
15 years 9 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
227
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
121
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
118
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
132
click to vote
CASES
2006
ACM
15 years 9 months ago
2006
ACM
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...