Results 11 to 20 of about 105,769,074 (273)
Merchants & Planters Compress & Warehouse Co. Statements
, 1949 Invoice to Dniel W. Kempner from Merchants & Planters Compress & Warehouse Company debiting his account for services provided, including labor furnished by Pete Shepherd and empty coops ...
Merchants & Planters Compress & Warehouse Company
core +11 more sources
Coding Strategies for Compress-and-Forward Relaying
, 2010 QC ...
Blasco-Serrano, Ricardo
openaire +2 more sources
Merchants & Planters Compress & Warehouse Co. Statements
, 1948 Invoice to Daniel W. Kempner from Merchants & Planters Compress & Warehouse Company debiting his account for services provided, including labor furnished by Pete Shepherd and egg cases ...
Merchants & Planters Compress & Warehouse Company
core +8 more sources
Merchants & Planters Compress & Warehouse Co. Statements
, 1950 Invoice to D. W. Kempner from Merchants & Planters Compress & Warehouse Company debiting his account for services provided, including labor performed by Peter Shepherd and return of egg case and coop during the month of January ...
Merchants & Planters Compress & Warehouse Company
core +8 more sources
MLP and CNN-based Classification of Points of Interest in Side-channel Attacks
International Journal of Networked and Distributed Computing (IJNDC), 2020 A trace contains sample points, some of which contain useful information that can be used to obtain a key in side-channel attacks. We used public datasets from the ANSSI SCA Database (ASCAD) as well as SM4 traces to learn whether a trace consisting of ...
Hanwen Feng +4 more
doaj +1 more source
Performance Evaluation of Advanced Relaying Protocols in Large Wireless Networks
IEEE Access, 2019 This paper studies the performance of some state-of-the-art cooperative full-duplex relaying protocols in the context of a large wireless network modeled using stochastic geometry tools.
Andres Altieri, Pablo Piantanida
doaj +1 more source
Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels
Entropy, 2012 Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward (DF), partial DF and compress-and-forward (CF) relaying ...
Majid Nasiri Khormuji, Mikael Skoglund
doaj +1 more source
Compress-and-Forward for Relay Broadcast Channels without Common Messages
Cybernetics and Information Technologies, 2015 This paper is connected with compress-and-forward strategy for two-user relay broadcast channels without common messages, where the relay node has private messages from the source, in addition to aiding traditional communication from the source to the ...
Song Xiaoxia, Li Yong
doaj +1 more source