Sciweavers

4075 search results - page 87 / 815
» Modeling Distributed Algorithm Using B
Sort
View
USENIX
1990
13 years 10 months ago
A New Design for Distributed Systems: The Remote Memory Model
This paper describes a new model for constructing distributed systems called the Remote Memory Model. The remote memory model consists of several client machines, one or more dedi...
Douglas Comer, Jim Griffioen
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 7 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
ICML
2004
IEEE
14 years 10 months ago
Learning random walk models for inducing word dependency distributions
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
Kristina Toutanova, Christopher D. Manning, Andrew...
TSP
2008
105views more  TSP 2008»
13 years 9 months ago
Semi-Supervised Linear Spectral Unmixing Using a Hierarchical Bayesian Model for Hyperspectral Imagery
This paper proposes a hierarchical Bayesian model that can be used for semi-supervised hyperspectral image unmixing. The model assumes that the pixel reflectances result from linea...
Nicolas Dobigeon, Jean-Yves Tourneret, Chein-I Cha...