Sciweavers

4007 search results - page 77 / 802
» Computation with imprecise probabilities
Sort
View
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
14 years 4 months ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 10 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
ICPR
2008
IEEE
14 years 11 months ago
Preliminary approach on synthetic data sets generation based on class separability measure
Usually, performance of classifiers is evaluated on real-world problems that mainly belong to public repositories. However, we ignore the inherent properties of these data and how...
Núria Macià, Ester Bernadó-Ma...
AINA
2010
IEEE
14 years 1 months ago
Detecting Suspicious Motion with Nonimaging Sensors
—Automated distributed sentry systems need only detect suspicious behavior. Microphones and infrared detectors may suffice, as well as being simpler and cheaper than cameras whil...
Neil C. Rowe, Ahren A. Reed, Jose J. Flores
BMVC
2010
13 years 8 months ago
Robust Texture Recognition Using Credal Classifiers
Texture classification is used for many vision systems; in this paper we focus on improving the reliability of the classification through the so-called imprecise (or credal) class...
Giorgio Corani, Alessandro Giusti, Davide Migliore...