Sciweavers

463 search results - page 56 / 93
» Induction in Noisy Domains
Sort
View
SIGSOFT
2006
ACM
16 years 17 days ago
Scenarios, goals, and state machines: a win-win partnership for model synthesis
Models are increasingly recognized as an effective means for elaborating requirements and exploring designs. For complex systems, model building is far from an easy task. Efforts ...
Christophe Damas, Bernard Lambeau, Axel van Lamswe...
APLAS
2005
ACM
15 years 5 months ago
Integrating Physical Systems in the Static Analysis of Embedded Control Software
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
Patrick Cousot
IJAR
2002
102views more  IJAR 2002»
14 years 11 months ago
Networks of probabilistic events in discrete time
The usual methods of applying Bayesian networks to the modeling of temporal processes, such as Dean and Kanazawa's dynamic Bayesian networks (DBNs), consist in discretizing t...
Severino F. Galán, Francisco Javier D&iacut...
TASLP
2010
138views more  TASLP 2010»
14 years 6 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...
TPHOL
2008
IEEE
15 years 6 months ago
A Type of Partial Recursive Functions
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta