4516 search results - page 859 / 904 » Data Structures in the Design of Interfaces |
129
click to vote
TKDE
2010
14 years 11 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
140
click to vote
BMCBI
2010
14 years 8 months ago
2010
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...
183
click to vote
JCST
2010
14 years 8 months ago
2010
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
101
click to vote
TVCG
2010
14 years 8 months ago
2010
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
209
click to vote
ISCA
2011
IEEE
14 years 5 months ago
2011
IEEE
Due to shrinking feature sizes processors are becoming more vulnerable to soft errors. Write-back caches are particularly vulnerable since they hold dirty data that do not exist i...