3368 search results - page 670 / 674 » GRID Computing |
ICALP
2003
Springer
14 years 28 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
HPCN
1997
Springer
13 years 12 months ago
1997
Springer
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...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
Classification of 3D objects remains an important task in many areas of data management such as engineering, medicine or biology. As a common preprocessing step in current approac...
VVS
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
SGP
2004
13 years 10 months ago
2004
Patterns on real-world objects are often due to variations in geometry across the surface. Height fields and other common parametric methods cannot synthesize many forms of geomet...