[PDF] Top 20 Fischer, Johannes (2007): Data Structures for Efficient String Algorithms. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik

... the string-matching literature (Andersson et ...construction algorithms for full- text indexes is yet a primary concern and an active field of research (Hon et ... See full document

... plex data structures are modeled as graphs which may be typed by a type ...Basic data types as well as object classes al- ready available in Java class libraries may be used and in addition, ... See full document

... Absolute Runtimes. Figure 5.5 presents the absolute runtimes of the new extended DBSCAN and OPTICS algorithms which integrate the multi-step query processing paradigm compared to the full table scan on the exact ... See full document

... standard data, which were also anal- ysed in Gertheiss and Tutz (2010). The data set consists of 2053 households with the response variable being monthly rent per square meter in ... See full document

... mining. Efficient algorithms have been developed for frequent subgraph mining, most prominently gSpan [Yan and Han, ...elegant data structures and branch-and-bound search strategies to lower ... See full document

... There are only a few proposals for tests in the context of generalized varying coefficient models, mainly using local likelihood modeling and spline smoothing. Zhang (2004) pro- poses a scaled chi-squared test in the ... See full document

... genomic data beyond ChIP-Seq, as we illustrated with a first application on DNA ...the data one chromosome at a time and the rather long runtime of more than 24 ... See full document

... series data as well as from trend and seasonally adjusted time ...complex structures which cannot suciently be reected by a single global feature, ... See full document

... 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

... index structures is a standard approach to speed up query processing for similarity ...index structures for metric spaces are needed to speed up query processing with the edge matching distance as ... See full document

... tomatisch und in Echtzeit Fische gezählt und klassifiziert werden können, die von einer Unterwasser-Sonarkamera vor einem Wasserkraftwerk gefilmt wur- ...Anzahl und Art der Fische können Maßnah- men ... See full document

... medical data this cannot be ...detection algorithms is the correct setting of ...underlying data is ...of data compres- sion which we use to distinguish outliers since they cannot be ... See full document

... The question we will try to answer next is whether the rather restricted payoff structure of ranking games makes it possible to compute instances of common solution concepts more efficiently than in general games. For ... See full document

... Sprache und sind dementsprechend veränder- ...Vergleichen und Zerlegen der kürzeren Wörter begonnen, und wäre – was wahrscheinlich ist – ein Wort mit einem einzigen Buchstaben (zum Beispiel a oder I) ... See full document

... 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

... messen und zu ...Ausschuss für Bankenauf- sicht (das Baseler Komitee), der aus Vertretern der Bankenaufsichten der großen Indus- trienationen ...übertragen und bildet heute u.a. die Grundlage ... See full document

... gem¨ aß Proposition 2 relativ schlecht, vgl. insbesondere (iii). Das liegt nicht etwa daran, dass Proposition 2 ein vorl¨ aufiges Resultat ist, sondern an der Tatsache, dass in der Greenschen Funktion der ... See full document

... speichern und physisch weiter tragen, bis sie einen geeigneten Kom- munikationspartner nden, der die Nachricht aufnimmt und wiederum weiter ...dungspotential und kommuniziert dies an Fahrzeug b (1), ... See full document

... 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

... Due to the inflationary use of the term Cloud Computing , it is very difficult to give an exact definition of the term. Following [Vou08, BK09], Cloud Computing allows users to access scalable, real-time, Internet-based ... See full document