[PDF] Top 20 Kunath, Peter (2006): Efficient Analysis in Multimedia Databases. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
Has 10000 "Kunath, Peter (2006): Efficient Analysis in Multimedia Databases. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik" found on our website. Below are the top 20 most common "Kunath, Peter (2006): Efficient Analysis in Multimedia Databases. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik".
Wiencierz, Andrea (2013): Regression analysis with imprecise data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... It is important to note that the notion imprecise data is sometimes used with a different meaning, for example, in the context of Fuzzy Statistics. In this and other frameworks, the quantities of interest are supposed to ... See full document
142
Yu, Shipeng (2006): Advanced Probabilistic Models for Clustering and Projection. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... tegral is however analytically infeasible. A straightforward Gibbs sampling method can be derived, but it turns out to be very slow and inapplicable to high dimensional discrete data like text, since for each word we ... See full document
188
Weigel, Felix (2006): Structural Summaries as a Core Technology for Efficient XML Retrieval. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Fast tree matching in large recursive document collections. XRel’s incorrect handling of certain queries against recursive collections was hinted at by Krishnamurthy et al. [2003], who concluded that “the general problem ... See full document
226
Song, Dongyi (2006): Combining Speech User Interfaces of Different Applications. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... of efficient context-free parsing for large and very ambiguous grammars, context-free parsing still poses a serious problem in many practical applications such as real-time speech ...very efficient ... See full document
209
Reithinger, Florian (2006): Mixed models based on likelihood boosting. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... The technological advancements in measurement, collection, and storage of data have led to more and more complex data-structures. Examples include measurements of individu- als’ behavior over time, digitized 2- or ... See full document
223
Sohler, Florian (2006): Contextual Analysis of Gene Expression Data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... protein databases provide links to some other database (usually a well known standard database) but not to all databases that might be of interest to the user, a combination of different mappings is often ... See full document
205
Rummel, David (2006): Correction for covariate measurement error in nonparametric regression. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Mostly, the type of functional relationship between independent and depen- dent variables in a regression context is hardly to predict a priori. A rea- sonable strategy lies then in adopting such a type of regression ... See full document
249
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
Bothmann, Ludwig (2016): Efficient statistical analysis of video and image data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... This thesis results from two interdisciplinary research projects involving the Institut für Statistik at the Ludwig-Maximilians-Universität München. The first project originates from the field of ... See full document
187
Brecheisen, Stefan (2007): Efficient and Effective Similarity Search on Complex Objects. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Tree-Structured Data. In addition to a variety of content-based at- tributes, complex objects typically carry some kind of internal structure which often forms a hierarchy. Examples of such tree-structured data include ... See full document
200
Wackersreuther, Bianca (2011): Efficient Knowledge Extraction from Structured Data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... The performance of similarity queries can be significantly improved if a multi- dimensional index structure supports the similarity search. Our index structure needs to be traversed in parallel for many search objects ... See full document
234
Achtert, Elke (2007): Hierarchical Subspace Clustering. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Given a set of n points from a d-dimensional vector space and a natural num- ber µ. Find a set of λ-dimensional hyperplanes in R d (λ < d) of minimum dimensionality to each of which at least µ points can be assigned ... See full document
222
Aßfalg, Johannes (2008): Advanced Analysis on Temporal Data. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... In the previous chapters we have introduced several new similarity measures for time series. In all these chapters we have considered regular time series where exactly one amplitude value is stored for each time slot. As ... See full document
262
Borgwardt, Karsten Michael (2007): Graph Kernels. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Data Integration As a first application of MMD, we performed distribution testing for data integration: the objective is to aggregate two datasets into a single sample, with the understanding that both original samples ... See full document
182
Rauschmayer, Axel (2010): Connected Information Management. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Society is currently inundated with more information than ever: stored in wikis, blogs, news feeds, web browser bookmarks, emails, and files such as PDFs, spreadsheet doc- uments, and text documents. When working with ... See full document
307
Syed, Tariq (2019): The generalized Vaserstein symbol. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... 1 und 6 > k ...notwendige und hinreichende Bedingung f¨ ur die Trivialit¨ at des Orbitraums U m P 0 ` R ~ SL P 0 ` R ¨ uber einer affinen Algebra von ... See full document
123
Schimanski, Stefan (2009): Polynomial Time Calculi. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... In Section 2.3 Light Linear Logic and Light Affine Logic are presented, first as a term calculus with a type system, and then using proof nets.. Finally, subsection 2.3.6 presents Light [r] ... See full document
281
Seisenberger, Monika (2003): On the Constructive Content of Proofs. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... the analysis of the constructive proofs of Higman’s Lemma in the second group have been investigated in our diploma thesis [Sei98], and therefore will not be considered in detail in this ... See full document
125
Vogel, Thomas (2004): Existence of Engel structures. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... In the construction of model Engel structures on round 3 –handles in Section 6.3 and at the final stage of the existence theorem (Theo- rem 6.1) in Section 6.4 we obtain an overtwisted c[r] ... See full document
169
Helbig, Michael (2009): Lifting of Nichols Algebras. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... Andruskiewitsch und Schneider [11] is the classification of all finite-dimensional pointed Hopf algebras where the prime divisors of the order of the abelian group Γ are > ... See full document
107
Related subjects