Sciweavers

1427 search results - page 263 / 286
» Kernels for Semi-Structured Data
Sort
View
HPDC
2003
IEEE
14 years 27 days ago
Optimizing GridFTP through Dynamic Right-Sizing
In this paper, we describe the integration of dynamic right-sizing — an automatic and scalable buffer management technique for enhancing TCP performance — into GridFTP, a sub...
Sunil Thulasidasan, Wu-chun Feng, Mark K. Gardner
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 12 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
IPPS
1998
IEEE
13 years 12 months ago
Pin-Down Cache: A Virtual Memory Management Technique for Zero-Copy Communication
The overhead of copying data through the central processor by a message passing protocol limits data transfer bandwidth. If the network interface directly transfers the user'...
Hiroshi Tezuka, Francis O'Carroll, Atsushi Hori, Y...
VISUALIZATION
1996
IEEE
13 years 11 months ago
Fast Perspective Volume Rendering with Splatting by Utilizing a Ray-Driven Approach
Volume ray casting is based on sampling the data along sight rays. In this technique, reconstruction is achieved by a convolution, which collects the contribution of multiple voxe...
Klaus Mueller, Roni Yagel
HPCN
1997
Springer
13 years 11 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher