Sciweavers

4541 search results - page 449 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
156
Voted
DSN
2007
IEEE
15 years 9 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
CGF
2000
127views more  CGF 2000»
15 years 4 months ago
Interactive High-Quality Maximum Intensity Projection
Maximum Intensity Projection (MIP) is a volume rendering technique which is used to visualize high-intensity structures within volumetric data. At each pixel the highest data valu...
Lukas Mroz, Helwig Hauser, Eduard Gröller
PVLDB
2008
107views more  PVLDB 2008»
15 years 3 months ago
Constrained locally weighted clustering
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
Hao Cheng, Kien A. Hua, Khanh Vu
SEMWEB
2010
Springer
15 years 2 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
159
Voted
EGH
2009
Springer
15 years 2 months ago
Parallel view-dependent tessellation of Catmull-Clark subdivision surfaces
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
Anjul Patney, Mohamed S. Ebeida, John D. Owens