Sciweavers

998 search results - page 144 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
SACMAT
2010
ACM
14 years 2 months ago
Monitoring security policies with metric first-order temporal logic
We show the practical feasibility of monitoring complex security properties using a runtime monitoring approach for metric first-order temporal logic. In particular, we show how ...
David A. Basin, Felix Klaedtke, Samuel Müller
EDBT
2009
ACM
135views Database» more  EDBT 2009»
14 years 2 months ago
Provenance for nested subqueries
Data provenance is essential in applications such as scientific computing, curated databases, and data warehouses. Several systems have been developed that provide provenance fun...
Boris Glavic, Gustavo Alonso
CIKM
2001
Springer
14 years 2 months ago
Automatic Discovery of Salient Segments in Imperfect Speech Transcripts
This paper addresses the problem of automatic detection of salient video segments for real-world applications such as corporate training based on associated speech transcriptions....
Dulce B. Ponceleon, Savitha Srinivasan
ACSAC
2000
IEEE
14 years 2 months ago
Less Harm, Less Worry or How to Improve Network Security by Bounding System Offensiveness
In this paper we describe a new class of tools for protecting computer systems from security attacks. Their distinguished feature is the principle they are based on. Host or netwo...
Danilo Bruschi, Lorenzo Cavallaro, Emilia Rosti
ISPD
2000
ACM
97views Hardware» more  ISPD 2000»
14 years 2 months ago
Routability-driven repeater block planning for interconnect-centric floorplanning
In this paper we present a repeater block planning algorithm for interconnect-centric floorplanning. We introduce the concept of independent feasible regions for repeaters and der...
Probir Sarkar, Vivek Sundararaman, Cheng-Kok Koh