2 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 2 / 2
Yayın Achievable rates for two user cooperative OFDMA(IEEE, 2010) Bakım, İsmail Sezi; Kaya, OnurWe propose two encoding strategies for a two user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) system, based on block Markov superposition encoding. We obtain the expressions for the resulting achievable rate regions for both encoding strategies, and evaluate them through simulations. We show that, by allowing for re-partitioning and re-encoding of the cooperative messages across subchannels, it is possible to better exploit the diversity created by OFDMA, and higher rates can be achieved.Yayın VC-dimension of univariate decision trees(IEEE-INST Electrical Electronics Engineers Inc, 2015-02-25) Yıldız, Olcay TanerIn this paper, we give and prove the lower bounds of the Vapnik-Chervonenkis (VC)-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension values of its subtrees and the number of inputs. Via a search algorithm that calculates the VC-dimension of univariate decision trees exhaustively, we show that our VC-dimension bounds are tight for simple trees. To verify that the VC-dimension bounds are useful, we also use them to get VC-generalization bounds for complexity control using structural risk minimization in decision trees, i.e., pruning. Our simulation results show that structural risk minimization pruning using the VC-dimension bounds finds trees that are more accurate as those pruned using cross validation.
