Sciweavers

548 search results - page 23 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
110
Voted
VLDB
2000
ACM
136views Database» more  VLDB 2000»
15 years 5 months ago
Managing Intervals Efficiently in Object-Relational Databases
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
15 years 11 months ago
Structure and Dynamics of Research Collaboration in Computer Science.
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
Andre Nash, Christian Bird, Earl T. Barr, Premkuma...
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 1 months ago
Programming an interpreter using molecular dynamics
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
Jan A. Bergstra, C. A. Middelburg
HPDC
1998
IEEE
15 years 6 months ago
Efficient Coupling of Parallel Applications Using PAWS
PAWS (Parallel Application WorkSpace) is a software infrastructure for use in connecting separate parallel applications within a component-like model. A central PAWS Controller co...
Peter H. Beckman, Patricia K. Fasel, William F. Hu...
PPOPP
2012
ACM
13 years 9 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...