Sciweavers

3128 search results - page 146 / 626
» Finite element method
Sort
View
136
Voted
CONCUR
2000
Springer
15 years 7 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
148
Voted
ICWS
2004
IEEE
15 years 4 months ago
Transforming BPEL into Annotated Deterministic Finite State Automata for Service Discovery
Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services. The reason for this limitation is the lack of a met...
Andreas Wombacher, Peter Fankhauser, Erich J. Neuh...
133
Voted
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 3 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...
MCS
2009
Springer
15 years 10 months ago
Improved Uniformity Enforcement in Stochastic Discrimination
There are a variety of methods for inducing predictive systems from observed data. Many of these methods fall into the field of study of machine learning. Some of the most effec...
Matthew Prior, Terry Windeatt
130
Voted
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 3 months ago
Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals
In this paper, we consider the problem of estimating finite rate of innovation (FRI) signals from noisy measurements, and specifically analyze the interaction between FRI technique...
Zvika Ben-Haim, Tomer Michaeli, Yonina C. Eldar