Sciweavers

516 search results - page 79 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 10 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 7 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
COCOON
2009
Springer
14 years 4 months ago
On the Readability of Monotone Boolean Formulae
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
CDC
2008
IEEE
156views Control Systems» more  CDC 2008»
14 years 4 months ago
Diagnosability of hybrid automata with measurement uncertainty
— We propose a diagnosability notion that depends on two parameters denoted as (δd, δm) for the general class of transition systems where the observable output is given by disc...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...
CCS
2007
ACM
14 years 4 months ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin