Sciweavers

11214 search results - page 201 / 2243
» Just-in-time data structures
Sort
View
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 10 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
VLSISP
2008
147views more  VLSISP 2008»
13 years 9 months ago
Data Reuse Exploration for Low Power Motion Estimation Architecture Design in H.264 Encoder
Data access usually leads to more than 50% of the power cost in a modern signal processing system. To realize a low-power design, how to reduce the memory access power is a critica...
Yu-Han Chen, Tung-Chien Chen, Chuan-Yung Tsai, Sun...
GLOBECOM
2010
IEEE
13 years 8 months ago
Assessing the Impact of Geographically Correlated Failures on Overlay-Based Data Dissemination
Abstract--This paper addresses reliability of data dissemination applications when there are severe disruptions to the underlying physical infrastructure. Such massive simultaneous...
Kyungbaek Kim, Nalini Venkatasubramanian
NAR
2010
94views more  NAR 2010»
13 years 5 months ago
Saccharomyces Genome Database provides mutant phenotype data
The Saccharomyces Genome Database (SGD; http:// www.yeastgenome.org) is a scientific database for the molecular biology and genetics of the yeast Saccharomyces cerevisiae, which i...
Stacia R. Engel, Rama Balakrishnan, Gail Binkley, ...
PVLDB
2010
190views more  PVLDB 2010»
13 years 5 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu