Sciweavers

238 search results - page 32 / 48
» Distributed Center-Location Algorithms: Proposals and Compar...
Sort
View
118
Voted
PRIB
2009
Springer
100views Bioinformatics» more  PRIB 2009»
15 years 7 months ago
Evidence-Based Clustering of Reads and Taxonomic Analysis of Metagenomic Data
Abstract. The rapidly emerging field of metagenomics seeks to examine the genomic content of communities of organisms to understand their roles and interactions in an ecosystem. I...
Gianluigi Folino, Fabio Gori, Mike S. M. Jetten, E...
IACR
2011
111views more  IACR 2011»
14 years 3 days ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
PAMI
2011
14 years 7 months ago
Greedy Learning of Binary Latent Trees
—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 ...
Stefan Harmeling, Christopher K. I. Williams
DEBS
2007
ACM
15 years 4 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
BMCBI
2007
129views more  BMCBI 2007»
15 years 17 days ago
Algebraic correction methods for computational assessment of clone overlaps in DNA fingerprint mapping
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
Michael C. Wendl