693 search results - page 48 / 139 » Categorical Properties of The Complex Numbers |
PODC
2004
ACM
14 years 1 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...
PSD
2004
Springer
14 years 29 days ago
2004
Springer
Generation of a synthetic microdata set that reproduces the statistical properties of an original microdata set is a promising approach to statistical disclosure control (SDC) of m...
RSCTC
2004
Springer
14 years 29 days ago
2004
Springer
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...