206 search results - page 8 / 42 » Weak Alternating Automata Are Not That Weak |
FMCAD
2006
Springer
13 years 11 months ago
2006
Springer
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
SIGPLAN
2008
13 years 7 months ago
2008
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transa...
ISCA
1998
IEEE
13 years 11 months ago
1998
IEEE
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
CSSC
2010
13 years 7 months ago
2010
: An example was given in the textbook All of Statistics (Wasserman, 2004, pages 186-188) for arguing that, in the problems with a great many parameters Bayesian inferences are wea...