Výsledky vyhľadávania - name=Algorithms and Complexity
-
1
Efficient Variant of Algorithm FastICA for Independent Component Analysis Attaining the CramÉr-Rao Lower Bound
ISSN: 1045-9227, 1941-0093Vydavateľské údaje: New York, NY IEEE 01.09.2006Vydané v IEEE transactions on neural networks (01.09.2006)“…FastICA is one of the most popular algorithms for independent component analysis (ICA), demixing a set of statistically independent sources that have been…”
Získať plný text
Journal Article -
2
Wait-free algorithms for fast, long-lived renaming
ISSN: 0167-6423, 1872-7964Vydavateľské údaje: Amsterdam Elsevier B.V 01.10.1995Vydané v Science of computer programming (01.10.1995)“… Previous wait-free renaming algorithms have time complexity that is dependent on the size of the original name space…”
Získať plný text
Journal Article -
3
A fast region segmentation algorithm on compressed gray images using Non-symmetry and Anti-packing Model and Extended Shading representation
ISSN: 1047-3203, 1095-9076Vydavateľské údaje: Elsevier Inc 01.01.2016Vydané v Journal of visual communication and image representation (01.01.2016)“…•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…”
Získať plný text
Journal Article -
4
Crypt-JDBC模型:洋葱加密算法的优化改进
ISSN: 1673-9418Vydavateľské údaje: 上海电力学院 计算机科学与技术学院,上海 200090%南京农业大学 信息科技学院,南京,210095 2017Vydané v 计算机科学与探索 (2017)“…TP392; CryptDB是一种典型的密文存储技术,它根据运算操作语义使用洋葱加密算法将SQL语句改写到不同的洋葱密文列,从而仅暴露数据的部分属性即可执行查询任务.针对洋葱加密…”
Získať plný text
Journal Article -
5
Recognition Method of Component Names in Patent Documents Based on the Algorithm of Word Frequency Difference and Library of Left-segmentation Words
ISSN: 1002-137XVydavateľské údaje: Chongqing Guojia Kexue Jishu Bu 01.07.2023Vydané v Ji suan ji ke xue (01.07.2023)“… units.Being flexible and changeable, the word formatting of component name represents the characteristics of uniqueness, complexity and lesser-known…”
Získať plný text
Journal Article -
6
Learning to Optimize: Training Deep Neural Networks for Interference Management
ISSN: 1053-587X, 1941-0476Vydavateľské údaje: New York IEEE 15.10.2018Vydané v IEEE transactions on signal processing (15.10.2018)“… However, optimization algorithms often entail considerable complexity, which creates a serious gap between theoretical design/analysis and real-time processing…”
Získať plný text
Journal Article -
7
Make It Short and Easy: Username Complexity Determines Trustworthiness Above and Beyond Objective Reputation
ISSN: 1664-1078, 1664-1078Vydavateľské údaje: Switzerland Frontiers Media S.A 19.12.2017Vydané v Frontiers in psychology (19.12.2017)“…? In 10 studies (total = 608) we explored username complexity and trustworthiness of eBay seller profiles…”
Získať plný text
Journal Article -
8
Enhancing Patient Identification Accuracy in Shared Child Health Records: a Hybrid Approach for the Lao Language Context
ISSN: 1573-689X, 0148-5598, 1573-689XVydavateľské údaje: New York Springer US 26.09.2025Vydané v Journal of medical systems (26.09.2025)“…, placeholder names such as “Eanoi”). Existing patient-matching algorithms designed for Latin scripts underperform in this context…”
Získať plný text
Journal Article -
9
Long lived adaptive splitter and applications
ISSN: 0178-2770, 1432-0452Vydavateľské údaje: Heidelberg Springer Nature B.V 01.04.2002Vydané v Distributed computing (01.04.2002)“… 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…”
Získať plný text
Journal Article -
10
An effective data indexing method for POI data
ISSN: 2161-024XVydavateľské údaje: IEEE 01.06.2015Vydané v International Conference on Geoinformatics (Online) (01.06.2015)“…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…”
Získať plný text
Konferenčný príspevok.. Journal Article -
11
Entanglement, and Unsorted Database Search in Noise-Based Logic
ISSN: 2076-3417, 2076-3417Vydavateľské údaje: Basel MDPI AG 2019Vydané v Applied sciences (2019)“…We explore the collapse of “wavefunction” and the measurement of entanglement in the superpositions of hyperspace vectors in classical physical…”
Získať plný text
Journal Article -
12
Efficient adaptive collect algorithms
ISSN: 0178-2770, 1432-0452Vydavateľské údaje: Heidelberg Springer Nature B.V 01.10.2007Vydané v Distributed computing (01.10.2007)“…), 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…”
Získať plný text
Journal Article -
13
Application of sparse identification of nonlinear dynamics for physics-informed learning
Vydavateľské údaje: IEEE 01.03.2020Vydané v 2020 IEEE Aerospace Conference (01.03.2020)“… 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…”
Získať plný text
Konferenčný príspevok.. -
14
Replacing suffix trees with enhanced suffix arrays
ISSN: 1570-8667, 1570-8675Vydavateľské údaje: Elsevier B.V 2004Vydané v Journal of discrete algorithms (Amsterdam, Netherlands) (2004)“… 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…”
Získať plný text
Journal Article -
15
Adaptive and efficient mutual exclusion
ISSN: 0178-2770, 1432-0452Vydavateľské údaje: Heidelberg Springer Nature B.V 01.07.2002Vydané v Distributed computing (01.07.2002)“… (and not on n, the total number of processes). Our algorithm has O(k) remote step complexity and O(log k…”
Získať plný text
Journal Article -
16
A Covert Timing Channel via Algorithmic Complexity Attacks: Design and Analysis
ISBN: 9781612842325, 1612842321ISSN: 1550-3607Vydavateľské údaje: IEEE 01.06.2011Vydané v 2011 IEEE International Conference on Communications (ICC) (01.06.2011)“… In this paper, we propose a new covert timing channel which exploits the algorithmic complexity vulnerabilities in the name lookup algorithm of the kernel…”
Získať plný text
Konferenčný príspevok.. -
17
LD-SPatt: large deviations statistics for patterns on Markov chains
ISSN: 1066-5277Vydavateľské údaje: United States 2004Vydané v Journal of computational biology (2004)“…Statistics on Markov chains are widely used for the study of patterns in biological sequences. Statistics on these models can be done through several…”
Zistit podrobnosti o prístupe
Journal Article -
18
Malicious Domain Names Detection Algorithm Based on N-Gram
ISSN: 2090-7141, 2090-715XVydavateľské údaje: Cairo, Egypt Hindawi Publishing Corporation 01.01.2019Vydané v Journal of computer networks and communications (01.01.2019)“…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…”
Získať plný text
Journal Article -
19
Improved F-DBSCAN for Trip End Identification Using Mobile Phone Data in Combination with Base Station Density
ISSN: 0197-6729, 2042-3195Vydavateľské údaje: London Hindawi 30.04.2022Vydané v Journal of advanced transportation (30.04.2022)“… The other is for reducing time complexity; a fast clustering improvement for the algorithm is proposed…”
Získať plný text
Journal Article -
20
Chemometrics for pattern recognition
ISBN: 9780470987254, 0470987251Vydavateľské údaje: Chichester, U.K Wiley 2009“… 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…”
Získať plný text
E-kniha Kniha

