49 search results - page 3 / 10 » Cryptography with Constant Input Locality |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper introduces a hybrid control scheme for steering a non-holonomic agent with limited sensing capabilities and input constraints through a stationary but unknown worksp...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Stabilizability of linear time invariant networked systems of general structure is studied with an observer-based approach. In the assumption of piecewise constant controls an ...
CCCG
1994
14 years 11 months ago
1994
We consider bounding the cardinality of an arbitrary triangulation with smallest angle : We show that if the local feature size (i.e. distance between disjoint vertices or edges) ...