1716 search results - page 148 / 344 » Proving Conditional Termination |
FTDCS
2004
IEEE
14 years 2 months ago
2004
IEEE
Web services are essentially black box components from a composer's or a mediator's perspective. The behavioural description of any service can be asserted by the compos...
CIE
2008
Springer
14 years 1 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
DLT
2007
14 years 19 days ago
2007
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In...
NIPS
1998
14 years 16 days ago
1998
The W-S (Wake-Sleep) algorithm is a simple learning rule for the models with hidden variables. It is shown that this algorithm can be applied to a factor analysis model which is a...
JCT
2006
13 years 11 months ago
2006
A Boolean function with an even number n = 2k of variables is called bent if it is maximally nonlinear. We present here a new construction of bent functions. Boolean functions of ...