709 search results - page 49 / 142 » An Equational Theory for Transactions |
TPDS
2010
14 years 9 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
: We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power...
EACL
1993
ACL Anthology
15 years 19 days ago
1993
ACL Anthology
This paper contributes to the theory of substructural logics .that are of interest to categorial grammarians. Combining semantic ideas of Hepple [1990] and Morrill [1990], proof-t...
ENTCS
2008
14 years 11 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
ICIP
2002
IEEE
16 years 27 days ago
2002
IEEE
In this paper, we present a novel information theoretic approach to image segmentation. We cast the segmentation problem as the maximization of the mutual information between the ...