Sciweavers

IMR
1998
Springer
13 years 9 months ago
Mesh Graph Structure for Longest-Edge Refinement Algorithms
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
Angel Plaza, José P. Suárez, Miguel ...
ECOOPW
1998
Springer
13 years 9 months ago
The Matrix Template Library: A Unifying Framework for Numerical Linear Algebra
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
Jeremy G. Siek, Andrew Lumsdaine
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
13 years 9 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
SIGCSE
1998
ACM
102views Education» more  SIGCSE 1998»
13 years 9 months ago
Design patterns for data structures
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
Dung Nguyen
POPL
1998
ACM
13 years 9 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
IPPS
1998
IEEE
13 years 9 months ago
Memory Space Representation for Heterogeneous Network Process Migration
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...
Kasidit Chanchio, Xian-He Sun
SCI
1999
Springer
13 years 9 months ago
Shared Memory Parallelization of the GROMOS96 Molecular Dynamics Code
This paper describes the parallelization of a commercial molecular dynamics simulation code, GROMOS96, on a SCI (Scalable Coherent Interface) interconnected PC cluster. The underly...
Marcus Dormanns
OOPSLA
1999
Springer
13 years 9 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
ICSE
1999
IEEE-ACM
13 years 9 months ago
Identifying Objects Using Cluster and Concept Analysis
Many approaches to support (semi-automatic) identification of objects in legacy code take the data structures as starting point for candidate classes. Unfortunately, legacy data ...
Arie van Deursen, Tobias Kuipers
CGI
1998
IEEE
13 years 9 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...