Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"algorithm complexity"”.
-
Toward building more accessible large language models: A preliminary empirical study on data scarcity in knowledge distillation and algorithm complexity in alignment
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms
-
A hierarchical verification of the IEEE-754 table-driven floating-point exponential function using HOL
… the most important standards. Deep datapath and algorithm complexity have made the verification of such floating-point units a very hard task. Most simulation and reachability analysis verification tools fail to verify a circuit with a deep datapath like most industrial floating-point units. …
-
Iterative detection for overloaded OFDMA with spatial diversity
… we formulate optimal MAP and reduced complexity MMSE symbol detection algorithms for the multiuser detection and single user decoding turbo loop. We verify the performance of each algorithm through Monte Carlo simulation with randomly generated multipath MIMO channels. From the results …
-
On the explanatory value of condition numbers for convex optimization : theoretical issues and computational experience
… sizes of feasible and optimal solutions to the complexity of algorithms for solving (CPd). However, it is not known to what extent these bounds might be reasonably close to their actual measures of interest. One difficulty in testing the practical relevance of such theoretical bounds is that …
-
A Quantamental approach to Bitcoin trading: Are we swinging for the Fences?
… to focus their investments in quantitative and algorithmic funds. Those methods run in server applications that execute automatic trades. It is important to distinguish high frequency trading from machine learning trading. The latter is used and analyzed in detail in the present work. This …
-
Enhancing association rules algorithms for mining distributed databases. Integration of fast BitTable and multi-agent association rules mining in distributed medical databases for decision support.
… for building an efficient Multi-Agent based algorithm for mining real world databases in geographically distributed sites. First, we propose the Distributed Multi-Agent Association Rules algorithm (DMAAR) to minimize the all-to-all broadcasting between distributed sites. Analytical …
-
A Family of Hierarchical Encoding Techniques for Image and Video Communications
… power. Also, the encoding and decoding algorithm complexity must be low due to the practical considerations of low-cost low-power receiver terminals. This requires image and video encoding techniques that jointly considers compression, scalability, robustness, and simplicity.</p> <p>In …
-
Heterogenous motorised traffic flow modelling using cellular automata
… cell states at each time step, on manoeuvre complexity and on acceptable space criteria for different vehicle types. Inclusion of heterogeneous traffic units increases the algorithm complexity as different criteria apply to different cellular elements, but mixed traffic is clearly more …
-
Improving Throughput and Efficiency for WLAN: Sounding, Grouping, Scheduling
… for given channel conditions. We design a low-complexity dynamic sounding approach that adjusts the sounding interval adaptively in real-time. Through our collected over-the-air channel measurements, we demonstrate significant throughput improvements using our proposed dynamic sounding …
-
Low-Complexity Algorithms for Channel Estimation in Optimised Pilot-Assisted Wireless OFDM Systems
… flat fading subchannels, and allows for low-complexity transceiver implementation based on the fast Fourier transform algorithms. Combining OFDM modulation with multilevel frequency-domain symbol mapping (e.g., QAM) and spatial multiplexing (SM) over the multiple-input multiple-output (MIMO) …
-
Partial Update Adaptive Filtering
… In practical applications, the computational complexity of an adaptive filter is an important consideration. The Least Mean Square (LMS) algorithm is widely used because of its low computational complexity (O(N)) and simplicity in implementation. The least squares algorithms, such as Recursive …
-
Algoritmy třídění
Práce se zabývá problémem třídění polí, který patří mezi známé problémy informatiky. Definuje pojmy třídění, algoritmus a složitost algoritmů. Popisuje vybrané algoritmy pro třídění od nejjednodušších po vybrané složitější konstrukce. Nakonec jsou algoritmy porovnány v závislosti na počtu operací a …
-
Development of an efficient fluid-structure interaction model for floating objects
… discretization is an increase in the algorithm complexity compared to a fully-explicit method, but it is still much simpler than a fully-implicit discretization of the governing equations. Indeed, the mass and momentum equations couple, and finding the unknowns involves solving a …
-
On the Development of a Very Fast Simulator for TH-UWB Systems = Sobre el Desarrollo de un Simulador Rápido para los Sistemas TH-UWB
… is on the length of the TDR waveform vector. The algorithm complexity is linear with the number of users, frames, multipath components, and rake fingers. In order to develop the simulation code, an important step in every simulation process is definition of the attributes of the physical device …