Sciweavers

1422 search results - page 144 / 285
» Hierarchical Spatial Data Structures
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
15 years 7 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
ISCA
2009
IEEE
143views Hardware» more  ISCA 2009»
16 years 1 months ago
Spatio-temporal memory streaming
Recent research advocates memory streaming techniques to alleviate the performance bottleneck caused by the high latencies of off-chip memory accesses. Temporal memory streaming r...
Stephen Somogyi, Thomas F. Wenisch, Anastasia Aila...
BMCBI
2005
125views more  BMCBI 2005»
15 years 6 months ago
Query3d: a new method for high-throughput analysis of functional residues in protein structures
Background: The identification of local similarities between two protein structures can provide clues of a common function. Many different methods exist for searching for similar ...
Gabriele Ausiello, Allegra Via, Manuela Helmer-Cit...
CAISE
2005
Springer
15 years 12 months ago
Integrating Unnormalised Semi-structured Data Sources
From Proc. CAiSE05 LNCS 3520, Pages 460-474 c Springer-Verlag 2005 Semi-structured data sources, such as XML, HTML or CSV files, present special problems when performing data int...
Sasivimol Kittivoravitkul, Peter McBrien
VISUALIZATION
2005
IEEE
15 years 12 months ago
Interactive Rendering of Large Unstructured Grids Using Dynamic Level-of-Detail
We describe a new dynamic level-of-detail (LOD) technique that allows real-time rendering of large tetrahedral meshes. Unlike approaches that require hierarchies of tetrahedra, ou...
Steven P. Callahan, João Luiz Dihl Comba, P...