6251 search results - page 45 / 1251 » Randomness, Computability, and Density |
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
The likelihood for patterns of continuous attributes for the naive Bayesian classifier (NBC) may be approximated by kernel density estimation (KDE), letting every pattern influenc...
DIS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In multi-instance learning, each example is described by a bag of instances instead of a single feature vector. In this paper, we revisit the idea of performing multi-ins...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
— This paper describes the hardware architecture for a flexible probability density estimation unit to be used in a Large Vocabulary Speech Recognition System, and targeted for m...
COMBINATORICS
2000
13 years 8 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...