Sciweavers

1763 search results - page 18 / 353
» Dependent random choice
Sort
View
ETT
2000
106views Education» more  ETT 2000»
13 years 8 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai
ENTCS
2008
95views more  ENTCS 2008»
13 years 9 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 9 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
IJCV
2000
93views more  IJCV 2000»
13 years 8 months ago
How Optimal Depth Cue Integration Depends on the Task
Bayesian parameter estimation can be used to generate statistically optimal solutions to the problem of cue integration. However, the complexity and dimensionality of these solutio...
Paul R. Schrater, Daniel Kersten
QEST
2010
IEEE
13 years 6 months ago
Information Hiding in Probabilistic Concurrent Systems
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
Miguel E. Andrés, Catuscia Palamidessi, Pet...