Sciweavers

125 search results - page 19 / 25
» A Recursive Embedding Approach to Median Graph Computation
Sort
View
GIS
2007
ACM
14 years 8 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
DAC
2005
ACM
14 years 8 months ago
Minimising buffer requirements of synchronous dataflow graphs with model checking
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
Marc Geilen, Twan Basten, Sander Stuijk
MICCAI
2009
Springer
14 years 10 days ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eï¬...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
ACSAC
2010
IEEE
13 years 5 months ago
Cujo: efficient detection and prevention of drive-by-download attacks
The JavaScript language is a core component of active and dynamic web content in the Internet today. Besides its great success in enhancing web applications, however, JavaScript p...
Konrad Rieck, Tammo Krueger, Andreas Dewald
DAC
2006
ACM
14 years 8 months ago
Efficient detection and exploitation of infeasible paths for software timing analysis
Accurate estimation of the worst-case execution time (WCET) of a program is important for real-time embedded software. Static WCET estimation involves program path analysis and ar...
Vivy Suhendra, Tulika Mitra, Abhik Roychoudhury, T...