2924 search results - page 334 / 585 » Lower Bounds in Distributed Computing |
161
click to vote
PODS
2001
ACM
16 years 4 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
120
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
132
Voted
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this paper, diversity analysis of bit-interleaved coded multiple beamforming (BICMB) is extended to the case of general spatial interleavers, removing a condition on their pr...
160
click to vote
RTSS
2009
IEEE
15 years 11 months ago
2009
IEEE
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
105
click to vote
ICRA
2007
IEEE
15 years 11 months ago
2007
IEEE
— This paper addresses the problem of restoring standing in paralegia via functional electrical stimulation (FES) and investigates the relashionship between body posture and volu...