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 52 matches
- 2024
- Richard Lettich:
A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition. CoRR abs/2406.01739 (2024) - 2023
- Hao Chen:
New Euclidean and Hermitian Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances. CoRR abs/2306.14342 (2023) - 2022
- Bilal Hammoud, Georges Daou, Norbert Wehn:
Multidimensional Minimum Euclidean Distance Approach Using Radar Reflectivities for Oil Slick Thickness Estimation. Sensors 22(4): 1431 (2022) - Chinwei Huang, Borching Su, Tingyi Lin, Yenming Huang:
Downlink SCMA Codebook Design With Low Error Rate by Maximizing Minimum Euclidean Distance of Superimposed Codewords. IEEE Trans. Veh. Technol. 71(5): 5231-5245 (2022) - 2021
- Chinwei Huang, Borching Su, Tingyi Lin, Yenming Huang:
Downlink SCMA Codebook Design with Low Error Rate by Maximizing Minimum Euclidean Distance of Superimposed Codewords. CoRR abs/2101.03355 (2021) - 2020
- Anton V. Eremeev, Mikhail Y. Kovalyov, Artem V. Pyatkin:
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances. LION 2020: 40-45 - 2019
- Wenlong Xia, Yuanping Zhou, Guide Yang, Ray T. Chen:
Optimal Minimum Euclidean Distance-Based Precoder for NOMA With Finite-Alphabet Inputs. IEEE Access 7: 45123-45136 (2019) - Yoshiaki Taniai, Tomohide Naniwa:
Joint Trajectory Planning Based on Minimum Euclidean Distance of Joint Angles of a Seven-Degrees-of-Freedom Manipulator for a Sequential Reaching Task. J. Adv. Comput. Intell. Intell. Informatics 23(6): 997-1003 (2019) - Junshan Luo, Shilian Wang, Fanggang Wang:
Joint Transmitter-Receiver Spatial Modulation Design via Minimum Euclidean Distance Maximization. IEEE J. Sel. Areas Commun. 37(9): 1986-2000 (2019) - V. A. Davydov:
On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem. Probl. Inf. Transm. 55(2): 145-151 (2019) - 2018
- Manar Mohaisen:
Increasing the minimum Euclidean distance of the complex quadrature spatial modulation. IET Commun. 12(7): 854-860 (2018) - 2016
- Julio B. Clempner, Alexander S. Poznyak:
Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method. Math. Comput. Simul. 119: 142-160 (2016) - Ping Yang, Yong Liang Guan, Yue Xiao, Marco Di Renzo, Shaoqian Li, Lajos Hanzo:
Transmit Precoded Spatial Modulation: Maximizing the Minimum Euclidean Distance Versus Minimizing the Bit Error Ratio. IEEE Trans. Wirel. Commun. 15(3): 2054-2068 (2016) - Kalpana Dahiya, Vinod Kumar Chauhan, Anuj Sharma:
Online Support Vector Machine Based on Minimum Euclidean Distance. CVIP (1) 2016: 89-99 - 2015
- Nan Li, Mohamad Sawan:
Neural signal compression using a minimum Euclidean or Manhattan distance cluster-based deterministic compressed sensing matrix. Biomed. Signal Process. Control. 19: 44-55 (2015) - Kees A. Schouhamer Immink, Jos H. Weber:
Hybrid Minimum Pearson and Euclidean Distance Detection. IEEE Trans. Commun. 63(9): 3290-3298 (2015) - Viet-Hoa Nguyen, Olivier Berder, Charlotte Langlais, Baptiste Vrigneau:
Distributed minimum euclidean distance based precoding for wireless sensor network. ICNC 2015: 918-923 - Richard Hsin-Hsyong Yang, Chia-Kun Lee:
Minimum Euclidean distance for continuous phase modulation with time-limited phase shaping pulses. ISPACS 2015: 619-624 - 2014
- Xiaodong Xu, Zhiyong Chen:
Recursive Construction of Minimum Euclidean Distance-Based Precoder for Arbitrary-Dimensional MIMO Systems. IEEE Trans. Commun. 62(4): 1258-1271 (2014) - Zhiyong Chen, Xiaodong Xu, Yufeng Zhao:
Linear precoder based on minimum Euclidean distance for multicast channels. PIMRC 2014: 183-187 - Zhiyong Chen, Xiaodong Xu, Xuchu Dai:
A low-complexity transceiver scheme based on minimum Euclidean distance criterion. WCSP 2014: 1-6 - 2013
- Quoc-Tuong Ngo, Olivier Berder, Pascal Scalart:
General minimum Euclidean distance-based precoder for MIMO wireless systems. EURASIP J. Adv. Signal Process. 2013: 39 (2013) - 2012
- Quoc-Tuong Ngo:
Généralisation des précodeurs MIMO basés sur la distance euclidienne minimale. (Generalized minimum Euclidean distance based precoders for MIMO spatial multiplexing systems). University of Rennes 1, France, 2012 - Dzevdan Kapetanovic, Fredrik Rusek, Traian E. Abrudan, Visa Koivunen:
Construction of Minimum Euclidean Distance MIMO Precoders and Their Lattice Classifications. IEEE Trans. Signal Process. 60(8): 4470-4474 (2012) - Quoc-Tuong Ngo, Olivier Berder, Pascal Scalart:
Minimum Euclidean Distance Based Precoders for MIMO Systems Using Rectangular QAM Modulations. IEEE Trans. Signal Process. 60(3): 1527-1533 (2012) - Quoc-Tuong Ngo, Olivier Berder, Pascal Scalart:
Minimum Euclidean Distance-Based Precoding for Three-Dimensional Multiple Input Multiple Output Spatial Multiplexing Systems. IEEE Trans. Wirel. Commun. 11(7): 2486-2495 (2012) - 2010
- Efraim Laksman, Håkan Lennerstad, Magnus Nilsson:
Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization. Discret. Math. 310(22): 3267-3275 (2010) - Ming Lei, Zhen-Hua Ling, Li-Rong Dai:
Minimum generation error training with weighted Euclidean distance on LSP for HMM-based speech synthesis. ICASSP 2010: 4230-4233 - Quoc-Tuong Ngo, Olivier Berder, Pascal Scalart:
3-D Minimum Euclidean Distance Based Sub-Optimal Precoder for MIMO Spatial Multiplexing Systems. ICC 2010: 1-5 - Sabine Kampf, Martin Bossert:
A fast Generalized Minimum Distance decoder for Reed-Solomon codes based on the extended Euclidean algorithm. ISIT 2010: 1090-1094
skipping 22 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-09-22 22:57 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