[PDF] Top 20 Engelhardt, Alexander (2017): Efficient estimation algorithms for large and complex data sets. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
Has 10000 "Engelhardt, Alexander (2017): Efficient estimation algorithms for large and complex data sets. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik" found on our website. Below are the top 20 most common "Engelhardt, Alexander (2017): Efficient estimation algorithms for large and complex data sets. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik".
Engelhardt, Alexander (2017): Efficient estimation algorithms for large and complex data sets. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Modern data sets have grown both more complex and greatly increased in ...size. Complex data sets include pedigrees, which have been analyzed in the field of genetics for decades ... See full document
107
Mauder, Markus (2017): Analyzing complex data using domain constraints. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Run times of all tested configurations are shown in Table 4.1. In Table 4.1, asterisks indicate that in at least one case, the repair algorithm did not terminate. Non-terminating cases are ignored for the computation of ... See full document
182
Fuchs, Karen (2017): Functional data analysis methods for the evaluation of sensor signals. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Wood, 2017, entry “family.mgcv” for details). This covers many data sets, but one can think of various further ...the data at hand, for example a Fourier basis for periodic ...many data ... See full document
228
Rieger, Anna (2017): Estimation of latent familial risks for colorectal cancer. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... In addition to the poor participation rate, there were mainly small families with a median of only 6 members reported. About a third of the recruited “families” consisted of only one person and were therefore excluded ... See full document
127
Brecheisen, Stefan (2007): Efficient and Effective Similarity Search on Complex Objects. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Genre classification. The general idea of hierarchical classification is that a classifier located on an inner node of the genre tree solves only a small classification problem and therefore achieves more effective ... See full document
200
Bothmann, Ludwig (2016): Efficient statistical analysis of video and image data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... image data are collected and cannot be analyzed manually due to the large data ...two complex problems of applied statistics which are motivated related to the global climate ...image ... See full document
187
Fischer, Johannes (2007): Data Structures for Efficient String Algorithms. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... given an array A[1, n] of elements from a totally ordered set (with order re- lation “ ≤ ”), rmq A (l, r) returns the index of a smallest element in A[l, r], i.e., rmq A (l, r) = arg min i∈[l:r] { A[i] } . (The subscript ... See full document
141
Haegler, Katrin (2011): Similarity Search in Medical Data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... a large amount of information loss. Hence, it is desirable to find a data structure which approximates the complex image data as accurate as ...classification algorithms do not use the ... See full document
223
Wiencierz, Andrea (2013): Regression analysis with imprecise data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... for large values of λ. Yet, which λ > 0 corresponds to an efficient Ridge estimator, is usually unknown in a practical setting, nevertheless, λ has to be fixed a ...regularized estimation can be ... See full document
142
Schönauer, Stefan (2004): Efficient Similarity Search in Structured Data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... are based on the same idea. Certain objects from the database are cho- sen as routing objects and during the query processing the distance to at least some of the routing objects have to be determined. Especially in the ... See full document
210
Kailing, Karin (2004): New Techniques for Clustering Complex Objects. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... attributes, complex objects typi- cally carry some kind of internal structure which often forms a ...original complex similarity ...structures, efficient and effective filters for structural ... See full document
229
Wackersreuther, Bianca (2011): Efficient Knowledge Extraction from Structured Data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... genetic algorithms, information theory and model-based ...hierarchical data mining, we also made contributions to more complex data structures, namely objects that consist of mixed type ... See full document
234
Stohr, Monika (2008): Unterricht in Kryptologie. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Mathematikunterricht und im Informatik- unterricht ...Caesar–Verschlüsselung und deren Verallgemeinerung durch die Chiffrierung mit einem Schlüsselwort sowie die Vigenère–Verschlüsselung ...werden. ... See full document
184
Shao, Junming (2011): Synchronization Inspired Data Mining. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... dimensional data becomes difficult for traditional clustering methods due to the problem called “curse of ...the data objects to be nearly equidistant from each other and objects do not cluster anymore in ... See full document
330
Yaghoobzadeh, Yadollah (2017): Distributed representations for fine-grained entity typing. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... The fine-grained typing of entities performed by FIGMENT can be used for knowledge base completion (KBC). Most KBC systems focus on relations between entities, not on types as we do. Some generalize the patterns of ... See full document
103
Zimek, Arthur (2008): Correlation Clustering. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... original data space in which the clustering can then be ...two-dimensional data set derived from the metabolic screening application. The data contain a set of patients, some of them healthy, others ... See full document
382
Mancin, Jacopo (2017): Topics of financial mathematics under model uncertainty. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... and J. Mancin. The manuscript was developed at the LMU Munich. Sec- tion 2 contains a new representation of a conditional sublinear expectation operator, developed by J. Mancin as suggested by F. Biagini. Sections ... See full document
129
Dorfmeister, Florian (2017): Schutz der Privatsphäre in kontext- und ortsbezogenen Diensten. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Privatsphäre und Perfor- manz des Systems ...problemlos und mit den gewohnten Reaktionszeiten genutzt werden ...Dienstschnittstellen und Algorithmen zur korrekten Beantwortung regi- onsbasierter ... See full document
275
Beck, Michael (2017): Algorithmen zum effizienten Deployment virtueller Netzwerkservices. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... vorgegeben und nicht variabel. Für jede VM sind die Hardwareanforderungen spezifiziert, die zum Betrieb benötigt ...ist für jede virtuelle Verbindung der Bandbreiten-Bedarf der ... See full document
172
Renz, Matthias (2006): Enhanced Query Processing on Complex Spatial and Temporal Data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... In particular, we introduce a novel similarity measure which does not only provide new prospects in data mining in time series databases but also allows to develop efficient methods for [r] ... See full document
331
Related subjects