Sciweavers

235 search results - page 30 / 47
» Quantization of Discrete Probability Distributions
Sort
View
DAIS
2011
12 years 11 months ago
Modeling the Performance of Ring Based DHTs in the Presence of Network Address Translators
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...
John Ardelius, Boris Mejías
CSB
2005
IEEE
135views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Relating transcription factors, modules of genes and cultivation conditions in Saccharomyces cerevisiae
Usually, the functionality of a module of co-expressed genes is derived from enrichment within the module of a particular gene annotation category. The systematic setup of the che...
Theo A. Knijnenburg, Marcel J. T. Reinders, J. M. ...
ISBI
2006
IEEE
14 years 8 months ago
Continuous image representations avoid the histogram binning problem in mutual information based image registration
Mutual information (MI) based image-registration methods that use histograms are known to suffer from the so-called binning problem, caused by the absence of a principled techniqu...
Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 5 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
Model Checking Probabilistic Timed Automata with One or Two Clocks
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
Marcin Jurdzinski, François Laroussinie, Je...