Filtern
Erscheinungsjahr
Dokumenttyp
- Dissertation (26) (entfernen)
Schlagworte
- Algorithmus (3)
- Middleware (3)
- Abfrageverarbeitung (2)
- Ad-hoc-Netz (2)
- Mobile Computing (2)
- OBDD (2)
- OBDDs (2)
- Peer-to-Peer-Netz (2)
- Selbstorganisation (2)
- mobile computing (2)
- (general) boustrophedon (returning) finite automata (1)
- (general) jumping finite automata (1)
- (regular : regular) array grammars (1)
- (regulär: regulär) Array-Grammati (1)
- Algorithmische Lerntheorie (1)
- Amortisierte Laufzeitanalyse (1)
- Amortized run time analysis (1)
- Analyse (1)
- Ankunftsprozess (1)
- Applikationsunterstützung (1)
- Automata Theory (1)
- Automatentheorie (1)
- BMAP (1)
- Bilddatenverarbeitung (1)
- Client-server-Konzept (1)
- Cluster (1)
- Consistency (1)
- DICOM-image (1)
- Datenspeicherung (1)
- Datenstruktur (1)
- Datenverdichtung (1)
- Directed Graphs (1)
- Disambiguierung von Personennamen (1)
- Distributed Systems (1)
- Dokumentverarbeitung (1)
- E-Learning (1)
- Elektronische Bibliothek (1)
- Erweiterung (1)
- Eulerian trails (1)
- Exact Algorithms (1)
- Exakte Algorithmen (1)
- Exponental time algorithms (1)
- Exponentialzeit Algorithmen (1)
- Fallbasiertes Schließen (1)
- Flussdiagramm (1)
- Formal Verification (1)
- Formal languages (1)
- Gerichteter Graph (1)
- Graph Minors (1)
- Graph Rewriting (1)
- Graph Visualization (1)
- Graphen mit Eulerschen Pfaden (1)
- Graphvisualisierung (1)
- Hyperlink-Management (1)
- Hyperlink-Proposals (1)
- Immersion <Virtuelle Realität> (1)
- Information Visualization (1)
- Informationssystem (1)
- Informationsvisualisierung (1)
- Integrated Circuits (1)
- Internet (1)
- Internetdienst (1)
- Kollaboration <Informatik> (1)
- Kom (1)
- Kombinatorische Optimierung (1)
- Komplexe Netzwerke (1)
- Komplexe Systeme (1)
- Komplexität (1)
- Komponente <Software> (1)
- Konsistenz (1)
- Logischer Entwurf (1)
- MMVE (1)
- Markov Jump Process (1)
- Markov-Kette (1)
- Markov-Prozess (1)
- Mathematische Lerntheorie (1)
- Measure & Conquer (1)
- Metadaten (1)
- Minor <Graphentheorie> (1)
- Mobile Networks (1)
- Mobile Telekommunikation (1)
- Modellierung (1)
- Multicast Communication (1)
- Multicastingverfahren (1)
- NP-hartes Problem (1)
- Netzwerk (1)
- Netzwerksimulation (1)
- Nichtlineare Dynamik (1)
- Näherungsverfahren (1)
- Operations Research (1)
- Ordered Binary Decision Diagrams (1)
- Overlay Network (1)
- Overlay-Netz (1)
- Parameterisierte Algorithmen (1)
- Parameterized Algorithms (1)
- Parametrisierte Approximation (1)
- Peer-to-Peer Network (1)
- Periodic Queues (1)
- Personenname (1)
- Pipeline (1)
- Prozessor (1)
- Pufferspeicher (1)
- Queues (1)
- RPC (1)
- Radiologie (1)
- Rechnernetz (1)
- Reduktionssystem (1)
- Regular Expressions (1)
- Regulärer Ausdruck (1)
- Request-Prediction (1)
- Robustheit (1)
- Server (1)
- Software Visualization (1)
- Softwarevisualisierung (1)
- Speicherdirektzugriff (1)
- Standard ML (1)
- Statistical Mechanics of complex networks (1)
- Statistische Mechanik komplexer Netze (1)
- Store-And-Forward Network (1)
- Store-And-Forward Netzwerk (1)
- Streaming <Kommunikationstechnik> (1)
- Synchronisierung (1)
- Synergie (1)
- Syntaktische Analyse (1)
- Telekommunikationsnetz (1)
- Theoretische Informatik (1)
- Transitionssystem (1)
- Verifikation (1)
- Verteiltes System (1)
- Virtual Environment (1)
- Virtuelle Realität (1)
- Virtuelle Umgebung (1)
- Visualisierung (1)
- Visualization (1)
- Warteschlangentheorie (1)
- Wartesystem (1)
- Web-Applications (1)
- Website-Management (1)
- Weitverkehrsnetz (1)
- Workflow-Programm (1)
- XML (1)
- XOR Parity (1)
- Zufallsgraph (1)
- ad-hoc network (1)
- algorithm analysis (1)
- application support (1)
- archiving (1)
- cache behavior (1)
- clustering (1)
- complex networks (1)
- complex systems (1)
- complexity (1)
- compression (1)
- computational geometry (1)
- controlled queueing system (1)
- convex hull (1)
- digital library (1)
- divide and conquer (1)
- endliche Boustrophedon-Automaten (1)
- formal verification (1)
- grammatical inference (1)
- historical metadata (1)
- home pages (1)
- incremental algorithm (1)
- information retrieval (1)
- jumping endliche Automaten (1)
- memory distance (1)
- middleware (1)
- mobile Telekommunikation (1)
- mobile ad-hoc network (1)
- multicore (1)
- multihop Netzwerk (1)
- multihop network (1)
- network simulation (1)
- numerical analysis (1)
- optimal control (1)
- parameterised approximation (1)
- partitioning (1)
- person name disambiguation (1)
- processing (1)
- radiology (1)
- reordering (1)
- search engine (1)
- threshold (1)
- time complexity (1)
- web-based services (1)
- zurückkehrende(RFA) (1)
Institut
- Informatik (26) (entfernen)
This thesis centers on formal tree languages and on their learnability by algorithmic methods in abstractions of several learning settings. After a general introduction, we present a survey of relevant definitions for the formal tree concept as well as special cases (strings) and refinements (multi-dimensional trees) thereof. In Chapter 3 we discuss the theoretical foundations of algorithmic learning in a specific type of setting of particular interest in the area of Grammatical Inference where the task consists in deriving a correct formal description for an unknown target language from various information sources (queries and/or finite samples) in a polynomial number of steps. We develop a parameterized meta-algorithm that incorporates several prominent learning algorithms from the literature in order to highlight the basic routines which regardless of the nature of the information sources have to be run through by all those algorithms alike. In this framework, the intended target descriptions are deterministic finite-state tree automata. We discuss the limited transferability of this approach to another class of descriptions, residual finite-state tree automata, for which we propose several learning algorithms as well. The learnable class by these techniques corresponds to the class of regular tree languages. In Chapter 4we outline a recent range of attempts in Grammatical Inference to extend the learnable language classes beyond regularity and even beyond context-freeness by techniques based on syntactic observations which can be subsumed under the term 'distributional learning', and we describe learning algorithms in several settings for the tree case taking this approach. We conclude with some general reflections on the notion of learning from structural information.