Sciweavers

7758 search results - page 60 / 1552
» On the Number of Distributive Lattices
Sort
View
IPPS
2002
IEEE
14 years 1 months ago
Detecting Temporal Logic Predicates on the Happened-Before Model
Detection of a global predicate is a fundamental problem in distributed computing. In this paper we describe new predicate detection algorithms for certain temporal logic predicat...
Alper Sen, Vijay K. Garg
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 3 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin
ICASSP
2009
IEEE
13 years 6 months ago
Blind sparse source separation for unknown number of sources using Gaussian mixture model fitting with Dirichlet prior
In this paper, we propose a novel sparse source separation method that can be applied even if the number of sources is unknown. Recently, many sparse source separation approaches ...
Shoko Araki, Tomohiro Nakatani, Hiroshi Sawada, Sh...
IWCMC
2006
ACM
14 years 2 months ago
Bounds on the fading number of multiple-input single-output fading channels with memory
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and...
Stefan M. Moser
MOC
2002
75views more  MOC 2002»
13 years 8 months ago
Average equidistribution and statistical independence properties of digital inversive pseudorandom numbers over parts of the per
This article deals with the digital inversive method for generating uniform pseudorandom numbers. Equidistribution and statistical independence properties of the generated pseudora...
Frank Emmerich