4075 search results - page 320 / 815 » Modeling Distributed Algorithm Using B |
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. W...
195
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
210
click to vote
CL
2007
Springer
15 years 6 months ago
2007
Springer
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
169
click to vote
COLT
1994
Springer
15 years 10 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
164
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...