4075 search results - page 636 / 815 » Modeling Distributed Algorithm Using B |
225
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Nonparametric Bayesian techniques have been developed recently to extend the sophistication of factor models, allowing one to infer the number of appropriate factors f...
148
click to vote
WDAG
1989
Springer
15 years 10 months ago
1989
Springer
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
207
click to vote
PAMI
2011
15 years 1 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
191
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
174
click to vote
COMPUTE
2010
ACM
15 years 10 months ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...