Sciweavers

4486 search results - page 808 / 898
» Adaptable Boundary Sets
Sort
View
VIS
2009
IEEE
246views Visualization» more  VIS 2009»
16 years 5 months ago
Supercubes: A High-Level Primitive for Diamond Hierarchies
Abstract-- Volumetric datasets are often modeled using a multiresolution approach based on a nested decomposition of the domain into a polyhedral mesh. Nested tetrahedral meshes ge...
Kenneth Weiss, Leila De Floriani
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 5 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
HPCA
2006
IEEE
16 years 4 months ago
Store vectors for scalable memory dependence prediction and scheduling
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
Samantika Subramaniam, Gabriel H. Loh
VLDB
2005
ACM
125views Database» more  VLDB 2005»
16 years 4 months ago
Sync your data: update propagation for heterogeneous protein databases
The traditional model of bench (wet) chemistry in many life sciences domain is today actively complimented by computer-based discoveries utilizing the growing number of online data...
Kajal T. Claypool, Elke A. Rundensteiner
VLDB
2006
ACM
124views Database» more  VLDB 2006»
16 years 4 months ago
Query optimization in XML structured-document databases
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...
Dunren Che, Karl Aberer, M. Tamer Özsu