Sökning: "Upper bounds"
Visar resultat 1 - 5 av 114 avhandlingar innehållade orden Upper bounds.
1. Algorithms, measures and upper bounds for satisfiability and related problems
Sammanfattning : The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of attention, particularly with the focus of producing algorithms with stronger theoretical guarantees, e.g. upper bounds on the running time on the form O(c^n) for some c. LÄS MER
2. Data driven modeling in the presence of time series structure: : Improved bounds and effective algorithms
Sammanfattning : This thesis consists of five appended papers devoted to modeling tasks where the desired models are learned from data sets with an underlying time series structure. We develop a statistical methodology for providing efficient estimators and analyzing their non-asymptotic behavior. LÄS MER
3. Limited Feedback Information in Wireless Communications : Transmission Schemes and Performance Bounds
Sammanfattning : This thesis studies some fundamental aspects of wireless systems with partial channel state information at the transmitter (CSIT), with a special emphasis on the high signal-to-noise ratio (SNR) regime. The first contribution is a study on multi-layer variable-rate communication systems with quantized feedback, where the expected rate is chosen as the performance measure. LÄS MER
4. Classifications and volume bounds of lattice polytopes
Sammanfattning : In this licentiate thesis we study relations among invariants of lattice polytopes, with particular focus on bounds for the volume.In the first paper we give an upper bound on the volume vol(P^*) of a polytope P^* dual to a d-dimensional lattice polytope P with exactly one interiorlattice point, in each dimension d. LÄS MER
5. Bounds on the Performance of PSK Block Codes
Sammanfattning : In wireless communication, the minimum Euclidean distance between codewords is a major factor for the ability to correct errors in messages, and it is of interest to maximize the minimum Euclidean distance. The thesis improves previously established general upper bounds on minimum Euclidean distance of phase shift keying block codes. LÄS MER