138 search results - page 19 / 28 » Bit-probe lower bounds for succinct data structures |
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract--In this paper, we consider multiple-input multipleoutput (MIMO) communication systems with combined channel covariance feedback (CCF) and channel gain feedback (CGF), her...
ACL
2007
13 years 9 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
DEXA
2003
Springer
14 years 1 months ago
2003
Springer
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
ADC
2003
Springer
14 years 1 months ago
2003
Springer
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...