Sciweavers

503 search results - page 35 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
EUROSYS
2007
ACM
15 years 6 months ago
Melange: creating a "functional" internet
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scot...
MICCAI
2009
Springer
15 years 11 months ago
Biomechanically-Constrained 4D Estimation of Myocardial Motion
We propose a method for the analysis of Magnetic Resonance (MR) cardiac images with the goal of reconstructing the motion of the ventricular walls. The main feature of our method i...
Hari Sundar, Christos Davatzikos, George Biros
WOSP
2010
ACM
14 years 10 months ago
Automatically improve software architecture models for performance, reliability, and cost using evolutionary algorithms
Quantitative prediction of quality properties (i.e. extrafunctional properties such as performance, reliability, and cost) of software architectures during design supports a syste...
Anne Martens, Heiko Koziolek, Steffen Becker, Ralf...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 3 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
ASIACRYPT
2008
Springer
14 years 11 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...