Results 261 to 270 of about 18,493,508 (291)
Some of the next articles are maybe not open access.
Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83, 1983
A methodology for transforming sequential recursive algorithms to distributive ones is suggested. The assumption is that the program segments between recursive calls have a distributive implementation. The methodology is applied to two k-selection algorithms and yields new distributed k-selection algorithms.
Liuba Shrira +2 more
openaire +1 more source
A methodology for transforming sequential recursive algorithms to distributive ones is suggested. The assumption is that the program segments between recursive calls have a distributive implementation. The methodology is applied to two k-selection algorithms and yields new distributed k-selection algorithms.
Liuba Shrira +2 more
openaire +1 more source
The Eulerian Distribution on k-Colored Involutions
Graphs and Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Ma 0017 +2 more
openaire +1 more source
The distribution of k-free numbers
Acta Mathematica Hungarica, 2009Let \(R_k(x) = \sum_{\substack{ n\geq x\\ k-\text{free}\,n}} 1 - \frac{x}{\zeta(k)}\) for an integer \(k\geq 2\). In [Recent Progress in Analytic Number Theory (Durham, 1979), vol. 1, 247--256 (1981; Zbl 0462.10029)] \textit{H. L. Montgomery} and \textit{R. C. Vaughan} proved that for \(\varepsilon > 0\) and \(\psi(w) = w - [w] - \frac 12\) \[ R_k(x) =
Baker, R. C., Powell, K.
openaire +2 more sources
The symmetrical n-k distribution
2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754), 2005This paper specializes and parameterizes the general result presented elsewhere in the literature in order to propose, fully characterize, and investigate the symmetrical n-k distribution. It yields estimators for the involved parameters and uses field measurements to validate the distribution.
Michel Daoud Yacoub +3 more
openaire +1 more source
Distributed k-mutual exclusion problem and k-coteries
Information Processing Letters, 1991The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes are in a critical section simultaneously. This problem can be solved using the k-coterie: We first prepare a set (k-coterie) C of sets (quorums) Q of processes such that each k-set {Q1,⋯, Qk} of quorums in C contains a pair Qi and Qj (i≠j) intersecting ...
Satoshi Fujita +2 more
openaire +2 more sources
On Distributed k-Anonymization
Fundamenta Informaticae, 2009When a database owner needs to disclose her data, she can k-anonymize her data to protect the involved individuals' privacy. However, if the data is distributed between two owners, then it is an open question whether the two owners can jointly k-anonymize the union of their data, such that the information suppressed in one owner's data is not revealed ...
openaire +3 more sources