Results 271 to 280 of about 18,493,508 (291)
Some of the next articles are maybe not open access.
Distributions of projections of uniformly distributed K-frames
2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2015A geometrical perspective is introduced that enables unification and generalization of several results regarding the distributions of quantities that arise in connection with an important class of multiple-channel detectors. Standard models on sets of normalized vectors following from joint Gaussian assumptions in this context are relaxed to the ...
Stephen D. Howard +2 more
openaire +2 more sources
Distributed recovery with K-optimistic logging
Proceedings of 17th International Conference on Distributed Computing Systems, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi-Min Wang, Om P. Damani, Vijay K. Garg
openaire +2 more sources
On the distribution of k-free integers
Acta Mathematica Hungarica, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The distributed k-server problem-a competitive distributed translator for k-server algorithms
Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992Summary: We consider the \(k\)-server problem [\textit{M. S. Manasse}, \textit{L. A. McGeoch} and \textit{D. D. Sleator}, J. Algorithms 11, No. 2, 208-230 (1990; Zbl 0705.68023)] in a distributed setting. Given a network of \(n\) processors and \(k\) identical mobile servers, requests for service appear at the processors and a server must reach the ...
Yair Bartal, Adi Rosén
openaire +4 more sources
Limiting Distribution for Distances in k-Trees
2009This paper examines the distances between vertices in a rooted k-tree, for a fixed k, by exhibiting a correspondence with a variety of trees that can be specified in terms of combinatorial specifications. Studying these trees via generating functions, we show a Rayleigh limiting distribution for expected distances between pairs of vertices in a random ...
Alexis Darrasse, Michèle Soria
openaire +1 more source
Distributed Testing of Distance-k Colorings
2020We study the distributed decision problem related to checking distance-k coloring, defined as color assignments to the nodes such that every pair of vertices at distance at most k must receive distinct colors. While checking the validity of a distance-k coloring only requires \(\lceil k/2\rceil \) rounds in the Local model, and a single round in the ...
Pierre Fraigniaud +2 more
openaire +2 more sources
Recursive K-distribution parameter estimation
IEEE Transactions on Signal Processing, 2005Recursive estimation of the parameter of the K-distribution is studied and tested. The probability density function (pdf) of the K-distribution is seen as a mixture pdf allowing the application of Titterington's recursive expectation-maximization (EM) technique.
Pei Jung Chung +2 more
openaire +1 more source
A distributed K-mutual exclusion algorithm
Proceedings of 15th International Conference on Distributed Computing Systems, 2002This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads.
Shailaja Bulgannawar, Nitin H. Vaidya
openaire +2 more sources
Distributed Top-k Pattern Mining
2021Frequent pattern mining (\(\mathsf {FPM}\)) on a single large graph has been receiving increasing attention since it is crucial to applications in a variety of domains including e.g., social network analysis. The \(\mathsf {FPM}\) problem is defined as finding all the subgraphs (a.k.a.
Xin Wang 0064 +6 more
openaire +2 more sources
A bivariate α-k-μ distribution
2016 IEEE Radio and Wireless Symposium (RWS), 2016In this paper summary, close-form expressions for the bivariate joint probability density function (PDF) and the outage probability (OP) of two-branch selection combining (SC) system in a correlated α-k-μ channel are obtained. The expressions are mathematically tractable, given in terms of well-known functions which are available in common mathematical
Rausley Adriano Amaral de Souza +1 more
openaire +1 more source