148 search results - page 14 / 30 » On data structures and asymmetric communication complexity |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
MSO
2003
13 years 8 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
ESCIENCE
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...