Sciweavers

27 search results - page 5 / 6
» Single I O Space for Scalable Cluster Computing
Sort
View
VIS
2004
IEEE
153views Visualization» more  VIS 2004»
15 years 2 days ago
Anisotropic Volume Rendering for Extremely Dense, Thin Line Data
Many large scale physics-based simulations which take place on PC clusters or supercomputers produce huge amounts of data including vector fields. While these vector data such as ...
Gregory L. Schussman, Kwan-Liu Ma
ANCS
2009
ACM
13 years 8 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
GIS
2008
ACM
14 years 12 months ago
Parallel ODETLAP for terrain compression and reconstruction
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Ran...
VIS
2004
IEEE
136views Visualization» more  VIS 2004»
15 years 2 days ago
Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...
ICALP
2009
Springer
14 years 11 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao