Sciweavers

3791 search results - page 753 / 759
» Workflows in Computation Grids
Sort
View
AGTIVE
2003
Springer
14 years 18 days ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
ICALP
2003
Springer
14 years 17 days ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
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 ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
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
ELPUB
2007
ACM
13 years 11 months ago
Technical Infrastructure and Policy Framework for Maximising the Benefits from Research Output
Electronic publishing is one part of a much larger process. There is a research lifecycle from creation of a programme for funded research through research proposals, projects, ou...
Keith G. Jeffery
CIKM
2006
Springer
13 years 11 months ago
3DString: a feature string kernel for 3D object classification on voxelized data
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...
Johannes Aßfalg, Karsten M. Borgwardt, Hans-...