Search results for "IONT"

showing 2 items of 382 documents

Sparsity-aware multiple relay selection in large multi-hop decode-and-forward relay networks

2016

In this paper, we propose and investigate two novel techniques to perform multiple relay selection in large multi-hop decode-and-forward relay networks. The two proposed techniques exploit sparse signal recovery theory to select multiple relays using the orthogonal matching pursuit algorithm and outperform state-of-the-art techniques in terms of outage probability and computation complexity. To reduce the amount of collected channel state information (CSI), we propose a limited-feedback scheme where only a limited number of relays feedback their CSI. Furthermore, a detailed performance-complexity tradeoff investigation is conducted for the different studied techniques and verified by Monte …

wireless networksTheoretical computer scienceComputer scienceMultiple relay selectionsComplex networks050801 communication & media studiesfeedback02 engineering and technologyData_CODINGANDINFORMATIONTHEORYchannelslaw.inventionHop (networking)diversityCommunication channels (information theory)[SPI]Engineering Sciences [physics]0508 media and communicationsMSERelaylaw0202 electrical engineering electronic engineering information engineeringComputer Science::Networking and Internet Architecture[ SPI ] Engineering Sciences [physics]Computer Science::Information TheoryLarge DF relay networksLink Access Procedure for Frame Relaycooperative networks05 social sciencesComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSRelay control systems020206 networking & telecommunicationsChannel state informationChannel state informationRelay selectionOutage probabilityAlgorithmRelay channel
researchProduct

On the Amount of Nonconstructivity in Learning Recursive Functions

2011

Nonconstructive proofs are a powerful mechanism in mathematics. Furthermore, nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [17] and Freivalds [11]. They allow to regard more complicated algorithms from the viewpoint of much more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem. In the present paper, the amount of nonconstructivity in learning of recursive functions is studied. Different learning types are compared with respect to the amount of nonconstructivity needed to lea…

μ operatorClass (set theory)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoretical computer sciencePrimitive recursive functionData_CODINGANDINFORMATIONTHEORYInductive reasoningMathematical proofUpper and lower boundsAlgorithmμ-recursive functionAutomatonMathematics
researchProduct