Sciweavers

47 search results - page 2 / 10
» On Bounding Problems of Quantitative Information Flow
Sort
View
DAC
2010
ACM
13 years 8 months ago
Theoretical analysis of gate level information flow tracking
Understanding the flow of information is an important aspect in computer security. There has been a recent move towards tracking information in hardware and understanding the flow...
Jason Oberg, Wei Hu, Ali Irturk, Mohit Tiwari, Tim...
ACSAC
2010
IEEE
13 years 2 months ago
Quantifying information leaks in software
Leakage of confidential information represents a serious security risk. Despite a number of novel, theoretical advances, it has been unclear if and how quantitative approaches to ...
Jonathan Heusser, Pasquale Malacaria

Publication
173views
12 years 3 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...
INFORMS
2010
125views more  INFORMS 2010»
13 years 3 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
INFORMS
2008
241views more  INFORMS 2008»
13 years 4 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker