Sciweavers

1819 search results - page 184 / 364
» Computability and Representations of the Zero Set
Sort
View
FUIN
2007
123views more  FUIN 2007»
15 years 6 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
STTT
2008
95views more  STTT 2008»
15 years 6 months ago
FAST: acceleration from theory to practice
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
Sébastien Bardin, Alain Finkel, Jér&...
FORTE
2009
15 years 4 months ago
Approximated Context-Sensitive Analysis for Parameterized Verification
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
MICS
2010
124views more  MICS 2010»
15 years 1 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
CAIP
2011
Springer
247views Image Analysis» more  CAIP 2011»
14 years 6 months ago
Exploiting Image Collections for Recovering Photometric Properties
Abstract. We address the problem of jointly estimating the scene illumination, the radiometric camera calibration and the reflectance properties of an object using a set of images...
Mauricio Díaz, Peter F. Sturm