Suchergebnisse - name=Algorithms and Complexity

Efficient Variant of Algorithm FastICA for Independent Component Analysis Attaining the CramÉr-Rao Lower Bound von Koldovsky, Z., Tichavsky, P., Oja, E.

“… FastICA is one of the most popular algorithms for independent component analysis (ICA), demixing a set of statistically independent sources that have been …”
Volltext

Wait-free algorithms for fast, long-lived renaming von Moir, Mark, Anderson, James H.

“… Previous wait-free renaming algorithms have time complexity that is dependent on the size of the original name space …”
Volltext

A fast region segmentation algorithm on compressed gray images using Non-symmetry and Anti-packing Model and Extended Shading representation von Zheng, Yunping, Sarem, Mudar

“… •We propose a fast algorithm for image segmentation by using NAMES.•We put forward 4 extended Lemmas and 2 extended Theorems for region segmentation.•We …”
Volltext

Crypt-JDBC模型:洋葱加密算法的优化改进 von 陈鹤, 田秀霞, 袁培森, 金澈清

“… TP392; CryptDB是一种典型的密文存储技术,它根据运算操作语义使用洋葱加密算法将SQL语句改写到不同的洋葱密文列,从而仅暴露数据的部分属性即可执行查询任务.针对洋葱加密 …”
Volltext

Recognition Method of Component Names in Patent Documents Based on the Algorithm of Word Frequency Difference and Library of Left-segmentation Words von Kong, Jiabin, Lyu, Jianwen, Liu, Jiangnan, Du, Wenxuan

“… units.Being flexible and changeable, the word formatting of component name represents the characteristics of uniqueness, complexity and lesser-known …”
Volltext

Learning to Optimize: Training Deep Neural Networks for Interference Management von Sun, Haoran, Chen, Xiangyi, Shi, Qingjiang, Hong, Mingyi, Fu, Xiao, Sidiropoulos, Nicholas D.

“… However, optimization algorithms often entail considerable complexity, which creates a serious gap between theoretical design/analysis and real-time processing …”
Volltext

Make It Short and Easy: Username Complexity Determines Trustworthiness Above and Beyond Objective Reputation von Silva, Rita R., Chrobot, Nina, Newman, Eryn, Schwarz, Norbert, Topolinski, Sascha

“… ? In 10 studies (total = 608) we explored username complexity and trustworthiness of eBay seller profiles …”
Volltext

Enhancing Patient Identification Accuracy in Shared Child Health Records: a Hybrid Approach for the Lao Language Context von Sorsavanh, Thepphouthone, Liu, Chang, Yamamoto, Goshiro, Mori, Yukiko, Kobayashi, Shinji, Kuroda, Tomohiro

“… , placeholder names such as “Eanoi”). Existing patient-matching algorithms designed for Latin scripts underperform in this context …”
Volltext

Long lived adaptive splitter and applications von Yehuda, Afek, Stupp, Gideon, Touitou, Dan

“… An implementation of a task is adaptive if the step complexity of any operation in the implementation is a function of the number of processes that take steps concurrently with the operation …”
Volltext

An effective data indexing method for POI data von Xu, Zhan-Ya, Xiong, Yi-Hui, Ye, Hong

“… The effective organization and management of POI data is an important basis for map service. In order to complete the auto-completion function, when users …”
Volltext

Entanglement, and Unsorted Database Search in Noise-Based Logic von Kish, Laszlo B., Daugherity, Walter C.

“… We explore the collapse of “wavefunction” and the measurement of entanglement in the superpositions of hyperspace vectors in classical physical …”
Volltext

Efficient adaptive collect algorithms von Afek, Yehuda, De Levie, Yaron

“… ), where n is the total number of processes in the system and k is the total contention. The step complexity of an unrestricted name space variant of this algorithm remains O(k …”
Volltext

Application of sparse identification of nonlinear dynamics for physics-informed learning von Corbetta, Matteo

“… The complexity of the algorithm architecture, e.g., the number of hidden layers in a deep neural network, typically grows with the complexity of the problems they are required to solve, leaving little room for interpreting (or explaining …”
Volltext

Replacing suffix trees with enhanced suffix arrays von Abouelhoda, Mohamed Ibrahim, Kurtz, Stefan, Ohlebusch, Enno

“… that uses an enhanced suffix array and solves the same problem in the same time complexity. The generic name enhanced suffix array stands for data structures consisting of the suffix array and additional tables …”
Volltext

Adaptive and efficient mutual exclusion von Attiya, Hagit, Bortnikov, Vita

“… (and not on n, the total number of processes). Our algorithm has O(k) remote step complexity and O(log k …”
Volltext

A Covert Timing Channel via Algorithmic Complexity Attacks: Design and Analysis von Xiaoshan Sun, Liang Cheng, Yang Zhang

“… In this paper, we propose a new covert timing channel which exploits the algorithmic complexity vulnerabilities in the name lookup algorithm of the kernel …”
Volltext

LD-SPatt: large deviations statistics for patterns on Markov chains von Nuel, G

“… Statistics on Markov chains are widely used for the study of patterns in biological sequences. Statistics on these models can be done through several …”
Weitere Angaben

Malicious Domain Names Detection Algorithm Based on N-Gram von Zeng, Xiang-Yan, Bao, Guangbin, Chang, Zhaobin, Hong, Zhao

“… Malicious domain name attacks have become a serious issue for Internet security. In this study, a malicious domain names detection algorithm based on N-Gram is …”
Volltext

Improved F-DBSCAN for Trip End Identification Using Mobile Phone Data in Combination with Base Station Density von Jiang, Haihang, Yang, Fei, Zhu, Xin, Yao, Zhenxing, Zhou, Tao

“… The other is for reducing time complexity; a fast clustering improvement for the algorithm is proposed …”
Volltext

Chemometrics for pattern recognition von Brereton, Richard G

“… This has been catalysed by the increase in capabilities of automated instruments such as LCMS, GCMS, and NMR, to name a few, to obtain large quantities of data, and, in parallel, the significant …”
Volltext