Suchergebnisse - Performance Keywords Approximation Algorithms

An efficient approach for searching optimal multi-keywords coverage routes von Yang, Rong, Niu, Baoning, Jin, Pengfei

“… Motivated by this, we propose an algorithm called Keyword-aware Skyline Route Generating (KSRG*). KSRG* consists of a preprocessing stage, in which KSRG …”
Volltext

Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime von Liu, Xin, Ying, Lei

“… $b-1$ with $b=O(\sqrt{\log N})$, i.e. a server can have at most one job in service and $b-1$ jobs queued. We focus on the steady-state performance of load-balancing algorithms in the heavy traffic regime such that the load of the system …”
Volltext

BOOSTING THE PERFORMANCE OF THE STATE-OF-ART IMAGE CLASSIFICATION TECHNIQUES von Vaqar, Aabid, Dr. Vijay Dhir

“… In the modern times, Query by Image is the fad. With the Digital Image Capture Devices made available at very low cost, the image database has been expanding …”
Volltext

Cost-effectiveness of algorithms von Farr, Graham

“… Discrete Algorithms In this paper we discuss how to assess the performance of algorithms for optimisation problems in a way that balances solution quality and time …”
Volltext

Approximations for two variants of the Steiner tree problem in the Euclidean plane von Li, Jianping, Wang, Haiyan, Huang, Binchao, Lichen, Junran

“… Given n terminals in the Euclidean plane and a positive constant l , find a Steiner tree T interconnecting all terminals with the minimum total cost of Steiner …”
Volltext

Optimization of Just-In-Sequence Supply: A Flower Pollination Algorithm-Based Approach von Bányai, Tamás, Illés, Béla, Gubán, Miklós, Gubán, Ákos, Schenk, Fabian, Bányai, Ágota

“… The performance, reliability, availability and cost efficiency are based on the parameters of the members of the supply chain process …”
Volltext

An adaptive greedy repair operator in a genetic algorithm for the minimum vertex cover problem von Moon, Seung-Hyun, Yoon, Yourim

“… A genetic algorithm (GA) evolves the population of candidate solutions to a particular problem through crossover and mutation operators …”
Volltext

Valuated matroid-based algorithm for submodular welfare problem von Maehara, Takanori, Murota, Kazuo

“… The algorithm has a guaranteed approximation ratio for a special case. Computational results show fairly good performance of the proposed algorithm …”
Volltext

High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs von Chkifa, Abdellah, Cohen, Albert, Schwab, Christoph

“… We consider the problem of Lagrange polynomial interpolation in high or countably infinite dimension, motivated by the fast computation of solutions to partial …”
Volltext

The role of the measurement configuration in inverse scattering from buried objects under the Born approximation von Persico, R., Bernini, R., Soldovieri, F.

“… with. The discussion is worked out in the framework of the linear model of the Born Approximation (BA) and the role of the measurement configuration is investigated with regard to the information content of the scattered field data …”
Volltext

Customer order scheduling to minimize total weighted completion time von Wang, Guoqing, Cheng, T.C. Edwin

“… While the problem has been shown to be unary NP-hard, we develop a heuristics to tackle the problem and analyze its worst-case performance …”
Volltext

Finding top- -cliques for keyword search from graphs in polynomial delay von Kargar, Mehdi, An, Aijun

“… (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image) Keyword search over structured data offers an alternative method to explore …”
Volltext

Efficient compression of molecular dynamics trajectory files von Marais, Patrick, Kenwood, Julian, Smith, Keegan Carruthers, Kuttel, Michelle M., Gain, James

“… We investigate whether specific properties of molecular dynamics trajectory files can be exploited to achieve effective file compression. We explore two …”
Volltext

FPGA Implementation of Enhanced JPEG Algorithm for Colored Images von Abed, Sa'ed, AlKandari, Mariam, AlRasheedi, Huda, Ahmad, Imtiaz

“… Image compression is an efficient method used to reduce the size of the image. JPEG algorithm has been considered as one of the famous techniques used for image compression …”
Volltext

Hypergraph index: an index for context-aware nearest neighbor query on social networks von Wang, Yazhe, Zheng, Baihua

“… The textual context of a node is defined as a set of keywords that describe …”
Volltext

SPARK-X: non-parametric modeling enables scalable and robust detection of spatial expression patterns for large spatial transcriptomic studies von Zhu, Jiaqiang, Sun, Shiquan, Zhou, Xiang

“… Spatial transcriptomic studies are becoming increasingly common and large, posing important statistical and computational challenges for many analytic tasks …”
Volltext

Piecewise linear detection for direct superposition modulation von Damrath, Martin, Hoeher, Peter Adam, Forkel, Gilbert J.M.

“… Thus, it is necessary to develop low-complexity detection algorithms with an APP-like performance, especially when performing iterative detection, for example in conjunction with bit interleaved coded modulation …”
Volltext

A novel numerical calculation method for electron guns von Kang, Y.F., Zhao, J., Zhao, J.Y., Tang, T.T.

“… The above two factors significantly limit the performances of electron guns. Moreover, the parameters of electron guns are approximated based on a limited number of electron trajectories …”
Volltext

Fast Approximations of Shift-Variant Blur von Denis, Loïc, Thiébaut, Eric, Soulez, Ferréol, Becker, Jean-Marie, Mourya, Rahul

“… Shift-invariant blur is fully characterized by a single point-spread-function (PSF). Blurring is then modeled by a convolution, leading to efficient algorithms for blur simulation and removal that rely on fast Fourier transforms …”
Volltext

Fast dimension reduction and integrative clustering of multi-omics data using low-rank approximation: application to cancer molecular classification von Wu, Dingming, Wang, Dongfang, Zhang, Michael Q., Gu, Jin

“… Results In this study, we proposed a novel low-rank approximation based integrative probabilistic model to fast find the shared principal subspace across multiple data types …”
Volltext