520 search results - page 59 / 104 » Subset Counting in Trees |
LOGCOM
2007
13 years 7 months ago
2007
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
ICASSP
2010
IEEE
13 years 2 months ago
2010
IEEE
Cooperative communication with multi-antenna relays can significantly increase the reliability and speed. However, cooperative MIMO detection would impose considerable complexity o...
DAGM
2005
Springer
14 years 1 months ago
2005
Springer
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
DM
2010
13 years 8 months ago
2010
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
APAL
2006
13 years 8 months ago
2006
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...