Sciweavers

1434 search results - page 94 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ACIVS
2006
Springer
14 years 22 days ago
Robust Analysis of Silhouettes by Morphological Size Distributions
We address the topic of real-time analysis and recognition of silhouettes. The method that we propose first produces object features obtained by a new type of morphological operato...
Olivier Barnich, Sébastien Jodogne, Marc Va...
TC
2010
13 years 7 months ago
Scalable Node-Level Computation Kernels for Parallel Exact Inference
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
Yinglong Xia, Viktor K. Prasanna
BMCBI
2007
148views more  BMCBI 2007»
13 years 9 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
IPPS
1997
IEEE
14 years 16 days ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
SPAA
1997
ACM
14 years 1 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...