Suchergebnisse - "time and space complexity of algorithms"

Mutual upper bounds of size and time for a Turing machine and a Markov–Post algorithm for mutual simulations von Kosovskii, N. K., Kosovskaya, T. M., Kosovskii, N. N.

“… A Markov–Post algorithm and a Turing machine, which have mutual upper bounds on time and space, are proven to be interchangeable up to a linear function of …”
Volltext

Self-paced learning for anchor-based multi-view clustering: A progressive approach von Ji, Xia, Cheng, Xinran, Zhou, Peng

“… Traditional anchor-based clustering methods effectively reduce the time and space complexity of algorithms by selecting representative samples to reconstruct similarity matrices …”
Volltext

Greedy spanner algorithms in practice von Farshi, M, Nasab, M J Hekmat

“… The major issue in computing greedy spanners is the high time and space complexity of algorithms that compute …”
Volltext

Design and implementation of Business-Driven BI platform based on cloud computing von Bin Wu, Lei Qin

“… of data, high time and space complexity of algorithms and the incompatibility in the Integration to the BI tools …”
Volltext

Constant Space and Non-Constant Time in Distributed Computing von Lempiäinen, Tuomo, Suomela, Jukka

“… We aim to remedy this by studying the time and space complexity of algorithms in a weak message-passing model of distributed computing …”
Volltext

A Robust Median-based Background Updating Algorithm von Hayfron-Acquah, James Ben

“… and space complexities of algorithms. A typical image processing task may involve several subtasks such as capturing, and pre-processing which demand high …”
Volltext

Spectral Sparsification of Hypergraphs von Soma, Tasuku, Yoshida, Yuichi

“… For an undirected/directed hypergraph \(G=(V,E)\), its Laplacian \(L_G\colon\mathbb{R}^V\to \mathbb{R}^V\) is defined such that its ``quadratic form'' …”
Volltext

Incremental rules mining for information compression matrix algorithm von Zhiqiang Geng, Qunxiong Zhu

“… It avoids traversing all attributes and records repeatedly, and reduces the time and space complexity of algorithm. Experimental results verify the efficiency and validity of the algorithm. The proposed method serves the operating optimization of ethylene cracking furnace quite well in the process industry …”
Volltext

Simple value ordering heuristic in frequency assignment problem von Jun Hu, Caminada, A., Mabed, H.

“… In order to reduce the time and space complexities of algorithm, we change the current value selection with last unchecked element in the domain, and put all the inconsistent values …”
Volltext