Bounds for computing the tame kernel

Artículos similares

A Selectable Sloppy Heap

Acceso

Adrian Dumitrescu

We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap that handles a dynamic version in which upon request (i) a new element is inserted or (ii) ... ver más

Revista: Algorithms

Proposing Enhanced Feature Engineering and a Selection Model for Machine Learning Processes

Acceso

Muhammad Fahim Uddin, Jeongkyu Lee, Syed Rizvi and Samir Hamada

Machine Learning (ML) requires a certain number of features (i.e., attributes) to train the model. One of the main challenges is to determine the right number and the type of such features out of the given dataset’s attributes. It is not uncommon f... ver más

Revista: Applied Sciences

Computing Upper Bounds to Error Probability of Soft-Decision Decoding of Reed Solomon Codes Based on the Ordered Statistics Algorithm

Acceso

Albanese, M. Spalvieri, A. Pág. 337 - 343

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Concatenated Codes: Distance Properties and Performance Bounds - Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Applications

Acceso

Garello, R; Pierleoni, P; Benedetto, S Pág. 800 - 812

Revista: IEEE JOURNAL OF SELECTED AREAS IN COMMUNICATIONS

NETWORK/SYSTEM COMPUTATION & ANALYSIS - An approach for computing tight numerical bounds on renewal functions

Acceso

Ayhan, H; Limon-Robles, J; Wortman, M Pág. 182 - 188

Revista: IEEE TRANSACTIONS ON RELIABILITY

Artículos similares

Revistas destacadas