Остановите войну!
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 168 matches
- 2012
- Nico Aerts, Marc Moeneclaey:
SAGE-based estimation algorithms for time-varying channels in Amplify-and-forward cooperative networks. ISITA 2012: 672-676 - Todorka Alexandrova, Gergely Huzsak, Hiroyoshi Morita:
Churn resilience in network coding-based anonymous P2P system. ISITA 2012: 270-274 - Mine Alsan:
Performance of mismatched polar codes over BSCs. ISITA 2012: 750-755 - Junya Amano, Tadahiro Wada, Kaiji Mukumoto:
An evaluation of a parallel transmission visible light communication system employing an LDPC code. ISITA 2012: 566-570 - Kazumaro Aoki:
A middletext distinguisher for full CLEFIA-128. ISITA 2012: 521-525 - Satoru Aoyama, Shogo Usami:
Consideration on modified gold sequences for optical CDM. ISITA 2012: 561-565 - Ryo Araki, Naoki Kobayashi, Akira Nakamura, Kohei Ohno, Makoto Itami:
Cooperative reception scheme using multiple terminals for digital terrestrial television broadcasting One-Segment Service. ISITA 2012: 135-139 - Shunsuke Araki, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki:
A study on precision of pseudorandom number generators using the logistic map. ISITA 2012: 740-744 - Mitsuharu Arimura, Ken-ichi Iwata:
On variable-to-fixed length coding of a general source with infinite alphabet. ISITA 2012: 485-488 - Yuta Ashida, Kuniyoshi Okuda, Wataru Uemura:
A VLC receiving devise using audio jacks with a folding noise. ISITA 2012: 475-479 - Asma Bagheri, Ghosheh Abed Hodtani:
Carrier to interference ratio in shotgun cellular systems over composite fading channels. ISITA 2012: 460-464 - Liang Chang, Jingde Xu, Kun Tang, Huijuan Cui:
A new robust pitch determination algorithm for telephone speech. ISITA 2012: 789-791 - Chitchanok Chuengsatiansup:
Faster elliptic curve arithmetic for double-base chain by reordering sequences of field operations. ISITA 2012: 411-445 - Bowen Dai, Lei Wei:
Some results and challenges on codes and iterative decoding with non-equal symbol probabilities. ISITA 2012: 116-120 - Elsa Dupraz, Aline Roumy, Michel Kieffer:
Source coding with side information at the decoder: Models with uncertainty, performance bounds, and practical coding schemes. ISITA 2012: 170-174 - Mustafa El-Halabi, Costas N. Georghiades:
On secure communication with known interference. ISITA 2012: 1-5 - John T. Flåm, Mikko Vehkaperä, Dave Zachariah, Efthymios Tsakonas:
Mean square error reduction by precoding of mixed Gaussian input. ISITA 2012: 81-85 - Yuki Fujii, Tadashi Wadayama:
A coding theoretic approach for evaluating accumulate distribution on minimum cut capacity of weighted random graphs. ISITA 2012: 332-336 - Masaya Fujisawa, Shojiro Sakata:
Improved multipoint codes from Hermitian curves. ISITA 2012: 431-435 - Yuichiro Fujiwara, Vladimir D. Tonchev:
A direct product construction for high-rate self-synchronizing codes. ISITA 2012: 226-229 - Yuichi Futa, Daichi Mizushima, Hiroyuki Okazaki:
Formalization of Gaussian integers, Gaussian rational numbers, and their algebraic structures with Mizar. ISITA 2012: 591-595 - Giuliano Gadioli La Guardia:
On nonbinary quantum nonprimitive non-narrow-sense BCH codes. ISITA 2012: 450 - T. Aaron Gulliver, Ulrich Speidel:
On the ratio between the maximal T-complexity and the T-complexity of random strings. ISITA 2012: 498-500 - Ryoji Haga, Shogo Usami:
Multi-bit flip type gradient descent bit flipping decoding using no thresholds. ISITA 2012: 6-10 - Manabu Hagiwara, James B. Nation:
Weight enumerator analysis for (2, P)- and (3, P)-SFA LDPC codes. ISITA 2012: 556-560 - Kohsuke Harada, Yasushi Tomizawa, Akihiko Takeo, Yuuichi Yamada, Kazuto Kashiwagi, Kenji Yoshida:
A study on read-back signal generation modeling for shingled-write magnetic recording from experimental results. ISITA 2012: 26-30 - Koichiro Hashiura, Fumie Ono:
Performance evaluation of the modified binary countdown scheme considering the priority of packet. ISITA 2012: 470-474 - Genji Hayashi, Tomoaki Ohtsuki:
Interference mitigation depending on the number of antennas and CSI available at femtocells. ISITA 2012: 150-154 - Qing He, Vangelis Angelakis, Anthony Ephremides, Di Yuan:
Revisiting minimum-length scheduling in wireless networks: An algorithmic framework. ISITA 2012: 506-510 - Xin He, Xiaobo Zhou, Khoirul Anwar, Tad Matsumoto:
Wireless mesh networks allowing intra-link errors: CEO problem viewpoint. ISITA 2012: 61-65
skipping 138 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-23 22: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