Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 46 matches
- 2023
- Yingwen Zhang, Meng Wang, Junru Li, Shiqi Wang, Siwei Ma, Weisi Lin:
Toward the Achievable Rate-Distortion Bound of VVC Intra Coding: A Beam Search-Based Joint Optimization Scheme. IEEE Trans. Image Process. 32: 6020-6031 (2023) - Mohammad Reza Deylam Salehi, Derya Malak:
An Achievable Low Complexity Encoding Scheme for Coloring Cyclic Graphs. Allerton 2023: 1-8 - 2022
- Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Alberto Ramos, Leonardo D. Secchin:
On the best achievable quality of limit points of augmented Lagrangian schemes. Numer. Algorithms 90(2): 851-877 (2022) - Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Alberto Ramos, Leonardo D. Secchin:
Correction to: On the best achievable quality of limit points of augmented Lagrangian schemes. Numer. Algorithms 90(2): 879-880 (2022) - Thura Phyo Khun Aung, Yuto Lim, Yasuo Tan:
Optimal Achievable Transmission Capacity Scheme for Full-Duplex Multihop Wireless Networks. Sensors 22(20): 7849 (2022) - Elena Peralta, Rafael Paiva, Mikko Valkama:
Uplink Transmission Schemes for 5G NR Unlicensed: Design Principles and Achievable Performance. VTC Spring 2022: 1-7 - 2021
- Thura Phyo Khun Aung, Yuto Lim, Yasuo Tan:
Optimal Achievable Transmission Capacity Scheme with Transmit Power Control in Full-duplex Wireless Multihop Networks. ICMU 2021: 1-6 - 2019
- Min Peng, Guoyin He, Lusheng Wang, Caihong Kai:
AP Selection Scheme Based on Achievable Throughputs in SDN-Enabled WLANs. IEEE Access 7: 4763-4772 (2019) - Rick Fritschek, Gerhard Wunder:
On the Gaussian Multiple Access Wiretap Channel and the Gaussian Wiretap Channel With a Helper: Achievable Schemes and Upper Bounds. IEEE Trans. Inf. Forensics Secur. 14(5): 1224-1239 (2019) - Sana Mazahir, Anas Chaaban, Hany Elgala, Mohamed-Slim Alouini:
Achievable Rates of Multi-Carrier Modulation Schemes for Bandlimited IM/DD Systems. IEEE Trans. Wirel. Commun. 18(3): 1957-1973 (2019) - Ming-Wei Wu, Tianyu Song, Yan Li, Xinwei Du, Pooi-Yuen Kam:
On-Off Controlled Wireless Transmission via Block-Acceptance Scheme Based on Measured Channel Gain - Achievable Diversity Order. IEEE Wirel. Commun. Lett. 8(4): 1175-1178 (2019) - 2018
- Weiqiang Tan, Wei Huang, Xi Yang, Zheng Shi, Wen Liu, Lisheng Fan:
Multiuser precoding scheme and achievable rate analysis for massive MIMO system. EURASIP J. Wirel. Commun. Netw. 2018: 210 (2018) - Zhaoqi Li, Yuyang Zhou:
Secure and Achievable Heterogeneous Access Control Scheme for Wireless Body Area Networks. FCS 2018: 190-198 - Bingli Jiao, Yuli Yang, Mingxi Yin:
Cocktail BPSK: Energy Reused Scheme for High Achievable Data Rates. CoRR abs/1811.01540 (2018) - 2017
- Zeeshan Kaleem, Bing Hui, KyungHi Chang:
Achievable rates of SVD-based codebooks for zero-forcing and Tomlinson-Harashima precoding schemes with limited feedback MU-MIMO system. Int. J. Commun. Syst. 30(7) (2017) - Rick Fritschek, Gerhard Wunder:
On the Gaussian Multiple Access Wiretap Channel and the Gaussian Wiretap Channel with a Helper: Achievable Schemes and Upper Bounds. CoRR abs/1712.04274 (2017) - 2016
- (Withdrawn) Rate-cost tradeoffs in control. Part II: achievable scheme. CoRR abs/1612.02128 (2016)
- 2015
- Jalal Habibi, Amir G. Aghdam, Ali Ghrayeb:
A Framework for Evaluating the Best Achievable Performance by Distributed Lifetime-Efficient Routing Schemes in Wireless Sensor Networks. IEEE Trans. Wirel. Commun. 14(6): 3231-3246 (2015) - Mohsen Rezaee, Peter J. Schreier, Maxime Guillaud, Bruno Clerckx:
A Simple DoF-Achievable Scheme for the Gaussian Interference Channel with Delayed CSIT. GLOBECOM 2015: 1-6 - (Withdrawn) Degrees of Freedom for Instantaneous-Relay Aided Interference Channel: Bounds and Achievable Schemes. CoRR abs/1508.00927 (2015)
- 2014
- Andrea Abrardo, Gianluigi Ferrari, Marco Martalò, Michele Franceschini, Riccardo Raheli:
Orthogonal Multiple Access With Correlated Sources: Achievable Region and Pragmatic Schemes. IEEE Trans. Commun. 62(7): 2531-2543 (2014) - Jenhui Chen, Chih-Cheng Yang, Shiann-Tsong Sheu:
Downlink Femtocell Interference Mitigation and Achievable Data Rate Maximization: Using FBS Association and Transmit Power-Control Schemes. IEEE Trans. Veh. Technol. 63(6): 2807-2818 (2014) - Arya Mazumdar:
Achievable schemes and limits for local recovery on a graph. Allerton 2014: 909-913 - Ahmed A. Zewail, Mohammed Nafie, Yahya Mohasseb, Hesham El Gamal:
Achievable degrees of freedom region of MIMO relay networks using Detour Schemes. ICC 2014: 1860-1865 - Sadaf Salehkalaibar, Mohammad Reza Aref:
An achievable scheme for the one-receiver, two-eavesdropper broadcast channel. IWCIT 2014: 1-6 - 2013
- Kai Li, Mitsuyoshi Ito, Atsushi Esumi:
A 1/10000 lower error rate achievable SSD controller with Message-Passing Error Correcting Code architecture and Parity Area Combined scheme. CICC 2013: 1-3 - Byungjun Kang, Si-Hyeon Lee, Sae-Young Chung, Changho Suh:
A new achievable scheme for interference relay channels. ISIT 2013: 2419-2423 - Byungjun Kang, Si-Hyeon Lee, Sae-Young Chung, Changho Suh:
A New Achievable Scheme for Interference Relay Channels. CoRR abs/1303.1095 (2013) - 2012
- Reza Khosravi-Farsani:
How much rate splitting is required for a random coding scheme?: A new achievable rate region for the Broadcast Channel with Cognitive Relays. Allerton Conference 2012: 1959-1965 - Stefano Rini:
An extension to the chain graph representation of an achievable scheme. ITW 2012: 602-606
skipping 16 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-25 15:51 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint