The [[set]]s $$\mathcal{P}(\mathbb{N}) \cong (\mathbb{N} \Rightarrow [2]) \cong (\text{(set)} \mathbb{N} \rightharpoonup [1])$$ are not [[countable]] Once we prove ...
Taiwanese Journal of Mathematics, Vol. 14, No. 4 (August 2010), pp. 1537-1542 (6 pages) The domination number γ(G) of a graph G is the minimum cardinality among all dominating sets of G, and the ...
Abstract: The cardinalized probability hypothesis density (CPHD) filter has become one of the most acclaimed algorithms for multi-target Bayesian filtering due to its ability to accurately estimate ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback