Sciweavers

9405 search results - page 440 / 1881
» Computing a Model of Set Theory
Sort
View
CONCUR
2005
Springer
16 years 13 days ago
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
Ahmed Bouajjani, Markus Müller-Olm, Tayssir T...
KCAP
2005
ACM
16 years 13 days ago
An ontological approach to the construction of problem-solving models
Our ongoing work aims at defining an ontology-centered approach for building expertise models for the CommonKADS methodology. This approach (which is named "OntoKADS") i...
Sabine Bruaux, Gilles Kassel, Gilles Morel
FSTTCS
2009
Springer
16 years 1 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
SPIN
2007
Springer
16 years 1 months ago
BEEM: Benchmarks for Explicit Model Checkers
Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their corr...
Radek Pelánek
IJCV
2000
110views more  IJCV 2000»
15 years 6 months ago
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Javier Portilla, Eero P. Simoncelli