Sciweavers

11212 search results - page 546 / 2243
» Semi-persistent Data Structures
Sort
View
CIKM
2006
Springer
15 years 10 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
ESOP
2000
Springer
15 years 10 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
TMI
2008
141views more  TMI 2008»
15 years 7 months ago
Fast Noise Reduction in Computed Tomography for Improved 3-D Visualization
Computed tomography (CT) has a trend towards higher resolution and higher noise. This development has increased the interest in anisotropic smoothing techniques for CT, which aim t...
Michiel Schaap, Arnold M. R. Schilham, Karel J. Zu...
HPDC
1998
IEEE
15 years 11 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...
PEPM
1993
ACM
15 years 11 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel