Sciweavers

6181 search results - page 948 / 1237
» Transactional Cluster Computing
Sort
View
RTCSA
2000
IEEE
15 years 9 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
COMPGEOM
2000
ACM
15 years 9 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
DL
1999
Springer
154views Digital Library» more  DL 1999»
15 years 9 months ago
SOMLib: A Digital Library System Based on Neural Networks
Digital Libraries have gained tremendous interest with numerous research projects addressing the wealth of challenges in this field. While computational intelligence systems are ...
Andreas Rauber, Dieter Merkl
VL
1996
IEEE
157views Visual Languages» more  VL 1996»
15 years 9 months ago
Visualizing Program Executions on Large Data Sets
Understanding and interpreting a large data source is an important but challenging operation in many technical disciplines. Computer visualization has become a valuable tool to he...
John T. Stasko, Jeyakumar Muthukumarasamy
ICIAP
1997
ACM
15 years 9 months ago
A Method for Segmentation of CT Head Images
A novel method for automatic segmentation of computed tomography CT head images of patients having spontaneous intracerebral brain hemorrhage has been presented in this work. The...
Sven Loncaric, Domagoj Kovacevic