Sciweavers

1716 search results - page 284 / 344
» Proving Conditional Termination
Sort
View
110
Voted
ENTCS
2008
87views more  ENTCS 2008»
15 years 26 days ago
A Lightweight Approach for the Semantic Validation of Model Refinements
Model Driven Engineering proposes the use of models at different levels of ion. Step by step validation of model refinements is necessary to guarantee the correctness of the final ...
Claudia Pons, Diego García
95
Voted
CGF
2006
132views more  CGF 2006»
15 years 25 days ago
Verification of Physically Based Rendering Algorithms
Within computer graphics, the field of predictive rendering is concerned with those methods of image synthesis which yield results that do not only look real, but are also radiome...
Christiane Ulbricht, Alexander Wilkie, Werner Purg...
CORR
2006
Springer
113views Education» more  CORR 2006»
15 years 25 days ago
Decentralized Maximum Likelihood Estimation for Sensor Networks Composed of Nonlinearly Coupled Dynamical Systems
Abstract--In this paper, we propose a decentralized sensor network scheme capable to reach a globally optimum maximum-likelihood (ML) estimate through self-synchronization of nonli...
Sergio Barbarossa, Gesualdo Scutari
98
Voted
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 25 days ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
113
Voted
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 25 days ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan