3122 search results - page 251 / 625 » Storing Semistructured Data with STORED |
171
click to vote
LCN
2008
IEEE
16 years 1 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
154
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
148
click to vote
WCNC
2008
IEEE
16 years 29 days ago
2008
IEEE
— We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separa...
DATE
2007
IEEE
16 years 28 days ago
2007
IEEE
Combination of SECDED with a redundancy technique can effectively tolerate a high variation-induced defect rate in future processes. However, while a defective cell in a block can...
140
click to vote
ICCCN
2007
IEEE
16 years 28 days ago
2007
IEEE
—This paper presents an approach that reuses data stored in the frame memory and in the motion estimation (ME) internal buffer to avoid unnecessary memory accesses and redundant ...