Informatik
Refine
Year of publication
Document Type
- Preprint (771)
- Article (416)
- Working Paper (119)
- Doctoral Thesis (93)
- Diploma Thesis (47)
- Conference Proceeding (41)
- Book (37)
- Bachelor Thesis (36)
- diplomthesis (28)
- Report (25)
Has Fulltext
- yes (1645)
Is part of the Bibliography
- no (1645)
Keywords
- Lambda-Kalkül (21)
- Heavy Ion Experiments (19)
- Hadron-Hadron Scattering (12)
- Formale Semantik (11)
- Hadron-Hadron scattering (experiments) (10)
- Operationale Semantik (9)
- lambda calculus (9)
- Kongress (8)
- LHC (8)
- Textanalyse ; Linguistische Datenverarbeitung; Computerlinguistik (8)
- Computerlinguistik (7)
- Heavy-ion collision (7)
- Nebenläufigkeit (7)
- Programmiersprache (7)
- concurrency (7)
- Informatik (6)
- Linguistische Datenverarbeitung (6)
- Textanalyse (6)
- functional programming (6)
- semantics (6)
- ALICE (5)
- E-Learning (5)
- Kryptologie (5)
- Online-Publikation (5)
- Verifikation (5)
- contextual equivalence (5)
- pi-calculus (5)
- Collective Flow (4)
- Hochschule (4)
- Jets (4)
- Kollaboration <Informatik> (4)
- Lehre (4)
- Logik (4)
- Petri net (4)
- Präsenzlehre (4)
- Quark-Gluon Plasma (4)
- RDF (4)
- adequate translations (4)
- letrec (4)
- ALICE experiment (3)
- Beschreibungskomplexität (3)
- Contextual Equivalence (3)
- Funktionale Programmiersprache (3)
- Funktionale Programmierung (3)
- Heavy Ions (3)
- Information Retrieval (3)
- Jets and Jet Substructure (3)
- Kontextuelle Gleichheit (3)
- LLL-reduction (3)
- Natural Language Processing (3)
- Organic Computing (3)
- Random Graph (3)
- Semantic Web (3)
- Uniform Sampling (3)
- Verification (3)
- Verteiltes System (3)
- automated deduction (3)
- call-by-need (3)
- context lemma (3)
- functional programming languages (3)
- observational semantics (3)
- rewriting (3)
- verification (3)
- (surface) partial differential equations (2)
- Analog Circuits (2)
- Bildverarbeitung (2)
- BioCreative V.5 (2)
- BioNLP (2)
- Call-by-Need (2)
- Charm physics (2)
- Chiral Symmetry (2)
- Clustering (2)
- Commitment Scheme (2)
- Computer science (2)
- Data Mining (2)
- Databases (2)
- Degree Sequence (2)
- Digital Humanities (2)
- Effective Field Theories of QCD (2)
- Electroencephalography (2)
- Elektronische Bibliothek (2)
- External Memory (2)
- F.4.1 (2)
- FPGA (2)
- Finite Temperature or Finite Density (2)
- Finite Volumes (2)
- Heavy Quark Production (2)
- Kinect (2)
- Knapsack problem (2)
- Lambda Calculus (2)
- Lattice basis reduction (2)
- Learning Analytics (2)
- Lepton-Nucleon Scattering (experiments) (2)
- Logic in computer science (2)
- Logics (2)
- Mehragentensystem (2)
- Metadaten (2)
- Microarray (2)
- Multimodal Learning Analytics (2)
- NLP (2)
- Named entity recognition (2)
- Nichtdeterminismus (2)
- Numismatics (2)
- Oblivious Transfer (2)
- Paging (2)
- Particle Correlations and Fluctuations (2)
- Particle and resonance production (2)
- Pb–Pb collisions (2)
- Phase Transitions (2)
- Programming (2)
- Programmtransformation (2)
- Pufferspeicher (2)
- QCD (2)
- Randomization (2)
- Relationale Datenbank (2)
- San Jose (2)
- Semantics (2)
- Shortest lattice vector problem (2)
- Softwareentwicklung (2)
- Space-Time Symmetries (2)
- Subset sum problem (2)
- Switching Algorithm (2)
- Temporal Graph (2)
- Theoretische Informatik (2)
- Virtuelle Realität (2)
- Visualisierung (2)
- Visualization (2)
- WWW (2)
- Zellularer Automat (2)
- agent-based modeling (2)
- amyloid precursor protein (2)
- artificial intelligence (2)
- call-by-name (2)
- computational complexity (2)
- computational virology (2)
- context unification (2)
- data structures (2)
- economics (2)
- gene expression (2)
- hepatitis C virus (HCV) (2)
- hippocampus (2)
- infinitary lambda calculus (2)
- lambda-calculus (2)
- lazy evaluation (2)
- logics in artificial intelligence (2)
- lower bounds (2)
- massively parallel multigrid solvers (2)
- matching (2)
- morphology (2)
- neural networks (2)
- non-determinism (2)
- nondeterminism (2)
- parameter estimation (2)
- population dynamics (2)
- pp collisions (2)
- presynaptic active zone (2)
- program transformation (2)
- programming languages (2)
- realistic geometries (2)
- second order unification (2)
- segments (2)
- septic shock (2)
- simulation (2)
- unification (2)
- viral dynamics (2)
- 3D (1)
- 3D spatio-temporal resolved mathematical models (1)
- 3D spatiotemporal resolved mathematical models (1)
- 900 GeV (1)
- ALICE detector (1)
- ATPG (1)
- Abfrageverarbeitung (1)
- Abstraction (1)
- Abstrakte Reduktion (1)
- Abstrakter Automat (1)
- Active learning (1)
- Adaptive Prediction (1)
- Adaptive control (1)
- Adaptive process control (1)
- Affymetrix (1)
- Agent <Künstliche Intelligenz> (1)
- Agenten (1)
- Agents (1)
- Agroecology (1)
- Algebraische Gleichung (1)
- Algorithmus (1)
- Alice ML (1)
- Alpha equivalence (1)
- Alternate hydrophobicity (1)
- Amino acid pattern (1)
- Analog (1)
- Analog Verification (1)
- Analoges System (1)
- Analogschaltungen (1)
- Angiography (1)
- Anti-nuclei (1)
- Anwendungssystem (1)
- App ecosystem (1)
- Approximability (1)
- Approximation algorithm (1)
- Approximationsgüte (1)
- Approximierbarkeit (1)
- Arabidopsis thaliana metabolism (1)
- Architekturen (1)
- Artefakt (1)
- Artificial neural networks (1)
- Atrial fibrillation classification (1)
- Attention mechanism (1)
- Augmented Reality (1)
- Auswahlprozess (1)
- Automata theory (1)
- Automatic (1)
- Automatic prediction (1)
- Autonomie (1)
- Autonomous Learning (1)
- Autorensystem (1)
- Autorensysteme (1)
- BFS (1)
- BIM (1)
- BMRT (1)
- BRDF (1)
- BTF (1)
- Baumgrammatiken (1)
- Beauty production (1)
- Bedienstrategie (1)
- Behavioural ecology (1)
- Behavioural methods (1)
- Beleuchtungsmodell (1)
- Benchmark testing (1)
- Berechnungskomplexität (1)
- Berufswahl (1)
- Beta-sheet (1)
- Big Data (1)
- BigBench (1)
- Bilderwelten (1)
- Bildnisschutz (1)
- Biochemie (1)
- Biodiversity (1)
- Bioinformatics (1)
- Bioinformatik (1)
- Biomedical named entity recognition (1)
- Bitcoin (1)
- Blended learning (1)
- Blind Signature (1)
- Block Korkin—Zolotarev reduction (1)
- Boosted Jets (1)
- Breaking knapsack cryptosystems (1)
- C-reactive protein (1)
- CABG (1)
- CBM detector (1)
- CEMP (1)
- CERN (1)
- CHEMDNER (1)
- CRF (1)
- CT (1)
- CTL (1)
- Caché (1)
- Calcium (1)
- Call-by-need Lambda Calculus (1)
- Cameras (1)
- Cell staining (1)
- Cellular neural network (1)
- Centrality Class (1)
- Centrality Selection (1)
- Chatbot (1)
- Chiffrierung (1)
- Chinese Remainder Theorem (1)
- Claude Elwood (1)
- Clean (1)
- Closed World Assumption (CWA) (1)
- Closest Vector Problem (1)
- Coding Scheme (1)
- Cognition (1)
- Cognitive (1)
- Collaborative Filtering (1)
- Collective Flow, (1)
- Commitment (1)
- Commitment schemes (1)
- Comparison with QCD (1)
- Complexity (1)
- Computational Humanities (1)
- Computational complexity (1)
- Computational geometry (1)
- Computational models (1)
- Computational neuroscience (1)
- Computational science (1)
- Computer Science (1)
- Computersimulation (1)
- Concrete (1)
- Conjoint Analysis (1)
- Connected Components (1)
- Content-Based Filtering (1)
- Continual deep learning (1)
- Convolutional Neural Networks (1)
- Coordination (1)
- Correctness (1)
- Crowdsourcing (1)
- Cuneiform (1)
- Data Analytics (1)
- Data exploration (1)
- Data processing (1)
- Data protection (1)
- Data science (1)
- Dataflow Computing (1)
- Datenaustausch (1)
- Datenbank (1)
- Datenbanksystem (1)
- Datenintegration (1)
- Datenmodell (1)
- Datenqualität (1)
- Datenschutz (1)
- Deep learning (1)
- Deictic and iconic gestures (1)
- Depth-Map (1)
- Detector Readout (1)
- Developmental Robotics (1)
- Developmental biology (1)
- Dialog Generation (1)
- Dichte-getriebene Strömung (1)
- Didaktik (1)
- Dienstgüte (1)
- Differentielle Genexpression (1)
- Digital Rights Management (1)
- Digitalkamera (1)
- Dimensions-Adaptivität (1)
- Dimensionsreduktion (1)
- Direct Manipulation (1)
- Dirichlet bound (1)
- Discrete Logarithm (1)
- Diskrete Mathematik (1)
- Dispositional learning analytics (1)
- Divide-and-conquer-Verfahren (1)
- Dreidimensionale Computergraphik (1)
- Dynamic Graph Algorithms (1)
- Dynamical systems (1)
- EDISON competence framework (1)
- Echtzeitprogrammierung (1)
- Echtzeitsystem (1)
- Edge Switching (1)
- Educational institutions (1)
- Effective Field Theories (1)
- Ego-motion Estimation (1)
- Eigenbewegungsschaetzung (1)
- Ein-Ausgabe ; Funktionale Programmiersprache ; Lambda-Kalkül ; Nichtdeterminismus ; Operationale Semantik ; Programmtransformation (1)
- Eingebettetes System (1)
- Einteilung (1)
- Electron-pion identification (1)
- Electroweak interaction (1)
- Elektronik (1)
- Elektronisches Wasserzeichen (1)
- Elliptic flow (1)
- Energy Efficiency (1)
- Energy-efficiency (1)
- Engineering (1)
- Entropie (1)
- Entropie <Informationstheorie> (1)
- Entwurfsautomation (1)
- Entwurfsmuster (1)
- Equation of State (1)
- Erasure-Correcting Codes (1)
- Erlösrechnung (1)
- Error Mitigation (1)
- Euler method (1)
- Europe (1)
- Event-related potential (1)
- Exchange Format (1)
- Experimental Evaluation (1)
- Experimental Methods (1)
- Explicit Feedback (1)
- Extraterrestrial measurements (1)
- F.1.3 (1)
- FPGAs (1)
- Fachübergreifender Unterricht (1)
- Factoring (1)
- Fault Tolerance (1)
- Feasibility (1)
- Femtoscopy (1)
- Fiber Bundles (1)
- Fibre/foam sandwich radiator (1)
- Finanzanalyse (1)
- Flash Memories (1)
- Formal Verification (1)
- Formale Grammatik (1)
- Formale Sprache (1)
- Formale Verifikation (1)
- Formative assessment (1)
- Forschungswerkzeuge (1)
- Fourier-Motzkin algorithm (1)
- Frankfurt <Main, 2003> (1)
- Frontmatter (1)
- Futures (1)
- GPGPU (1)
- GPI (1)
- GPRO (1)
- GPU Computing (1)
- GPU algorithms (1)
- Gamification (1)
- Gedächtnis (1)
- Gedächtnisbildung (1)
- Gene expression (1)
- Generalized procrustes analysis (1)
- Genexpression (1)
- Geodesics (1)
- Germanistik (1)
- Gestural writing (1)
- Gleichheitsanalyse (1)
- Goal setting (1)
- Grammatiksysteme (1)
- Graph (1)
- Graph Algorithms (1)
- Graph database (1)
- Graph theory (1)
- Graphikprozessor (1)
- Green Computing (1)
- Großhirnrinde (1)
- Gruppe (1)
- H.2.3 (1)
- HASKELL (1)
- HBT (1)
- HCI (1)
- HEP-Computing (1)
- HPC (1)
- Hadron production (1)
- Hadron-Hadron Scattering Heavy (1)
- Hard Scattering (1)
- Hash Funktionen (1)
- Haskell (1)
- Haskell 98 (1)
- Hauptkomponentenanalyse (1)
- Heavy Ion Experiment (1)
- Heavy flavor production (1)
- Heavy flavour production (1)
- Heavy ions (1)
- Heavy-Ion Collision (1)
- Heavy-flavour decay muons (1)
- Heavy-ion collisions (1)
- Hematoxylin staining (1)
- Heuristics (1)
- Heuristik (1)
- High Level Synthesis (1)
- High Throughput Computing / HTC (1)
- High energy physics (1)
- Higher education (1)
- Histology (1)
- Hive (1)
- Hodgkin lymphoma (1)
- Householder reflection (1)
- Hybrid automaton (1)
- Hydrophobicity scale (1)
- Hypercube (1)
- Hypertext (1)
- I/O Model (1)
- ICA (1)
- IS post-adoption (1)
- IT-literacy (1)
- Iconography (1)
- Identification (1)
- Image processing (1)
- Image schemata (1)
- Image-based-rendering (1)
- Implicit Discourse Parsing (1)
- Implicit Feedback (1)
- Implicit Semantic Role Labeling (1)
- In-TIPS thrombosis (1)
- Inclusive spectra (1)
- Independent Component Analysis ICA (1)
- Induktive Inferenz (1)
- Infinite games with perfect information (1)
- Inflammation (1)
- Infomediary (1)
- Information Overkill (1)
- Informationelle Ungewissheit (1)
- Informationelles Selbstbestimmungsrecht (1)
- Informationsintegration (1)
- Informationsportal (1)
- Informationssystem (1)
- Informationsüberflutung (1)
- Infrastruktur (1)
- Inhaltsbasiertes Filtern (1)
- Integer relations (1)
- Intensity interferometry (1)
- Intensivpatient (1)
- InterSystems (1)
- Interaktion (1)
- Internet (1)
- Internetportal (1)
- Interoperabilität (1)
- Interpretierer (1)
- Intrinsic Motivations (1)
- Invariant Mass Distribution (1)
- Invariant object recognition (1)
- Ionisation energy loss (1)
- Ionizing Radiation (1)
- Isolation (1)
- Iteratives Array (1)
- Java (1)
- Java, Programmiersprache (1)
- Jet Physics (1)
- Jet Substructure (1)
- Kalman Filter (1)
- Kalman filter (1)
- Kalman-Filter (1)
- Kinetic hypertext authoring (1)
- Klebsiella pneumoniae (1)
- Kluft (1)
- Knowledge engineering (1)
- Kohonen map (1)
- Kohonen mapping (1)
- Kollaboratives Filtern (1)
- Kolmogorov complexity (1)
- Kommunikationsprotokoll ; Komplexitätstheorie ; Stochastischer Automat ; Nichtdeterministischer Automat ; Quantencomputer (1)
- Kommunikationssystem (1)
- Kompetenz (1)
- Kompetenzmessung (1)
- Komponente <Software> (1)
- Kontext (1)
- Kontextuelle Gleicheit (1)
- Koordination (1)
- Korkin—Zolotarev reduction (1)
- Kostenrechnung (1)
- Kryptographie (1)
- Kryptosystem (1)
- Künstliches Hormonsystem (1)
- LSTM (1)
- LTP (1)
- LZW-Algorithmus (1)
- Label cover (1)
- Langzeitgedächtnis (1)
- Large Language Models (1)
- Lateral inhibited network (1)
- Lattice QCD (1)
- Lattice Quantum Field Theory (1)
- Lattice Reduction (1)
- Lattice-QCD (1)
- Layout (1)
- Learner goals (1)
- Learning analytics (1)
- Learning analytics dashboard (1)
- Learning dispositions (1)
- Leichtgewichtige Kryptographie (1)
- Lernen (1)
- Letrec-Kalkül (1)
- Lifelong machine learning (1)
- Line reconstruction (1)
- Linked Data (1)
- Linux Container (1)
- Local field potential (1)
- Low density subset sum algorithm (1)
- Lymph nodes (1)
- Lymphocytes (1)
- MIMIC-III (1)
- ML <Programmiersprache> (1)
- Machine learning (1)
- Manatee invariant (1)
- Manhattan distance (1)
- Many-core computer architectures (1)
- MapReduce (1)
- Markov Chain (1)
- Maschinelles Lernen (1)
- Material budget (1)
- Mathematical model (1)
- Mathematik (1)
- McEliece (1)
- Medical Systems (1)
- Medical database (1)
- Medienkompetenz (1)
- Medienproduktion (1)
- Membranpotential (1)
- Mensch-Maschine-Kommunikation (1)
- Merkmalsraum (1)
- Merkmalsselektion (1)
- Message authentication (1)
- Mid-rapidity (1)
- Middleware (1)
- Minimum Bias (1)
- Mitochondria (1)
- Mobile Phones (1)
- Mobile platforms (1)
- Model Checking (1)
- Modellgetriebene Architektur (MDA) (1)
- Modellierung (1)
- Modular Multiplication (1)
- Monte Carlo (1)
- Multi-Parton Interactions (1)
- Multi-strange baryons (1)
- Multi-wire proportional drift chamber (1)
- Multimedia (1)
- Multiset independent component analysis (1)
- Museum (1)
- Museum information system (1)
- Museums (1)
- Musik (1)
- NF-κB pathway (1)
- NP-complete problems (1)
- NP-hard (1)
- NP-hardness (1)
- NREM-Schlaf (1)
- Natural Language Understanding (1)
- Network models (1)
- Netzzusammenschaltung (1)
- Neural Networks (1)
- Neural encoding models (1)
- Neural network (1)
- Neural networks (1)
- Neurofuzzy (1)
- Neurofuzzy medical systems (1)
- Neuronale Plastizität (1)
- Neuronales Netz (1)
- Neuronales Netzwerk (1)
- Nichtlineare Datenanalyse (1)
- Nichtlineare Merkmalsselektion (1)
- Noisy point clouds (1)
- Non-Malleability (1)
- Non-determinism (1)
- Nonlinear Data Analysis (1)
- Nonlinear Feature Selection (1)
- Normalisierung (1)
- Noticeable Probability (1)
- Nuclear Physics (1)
- Nuclear modification factor (1)
- ODE (1)
- ORC (1)
- Object vision (1)
- Objekterkennung (1)
- Objektorientiertes Datenbanksystem ; Schemaevolution ; Version <Informatik> (1)
- Objektorientierung (1)
- Offenes Kommunikationssystem ; Verteiltes System ; Telekommunikationsdienst ; Vermittlung ; Typ ; Wissensbasiertes System (1)
- Online Algorithmen (1)
- Online Algorithms (1)
- Online algorithms (1)
- Online self-assessment (1)
- Online-Self-Assessment (1)
- Ontologien (1)
- Ontologies (1)
- Ontology (1)
- Open set recognition (1)
- Open world learning (1)
- Open-access data resource (1)
- Operational Semantics (1)
- Oracle Query (1)
- PCA-Zerlegung (1)
- PDE (1)
- PDEs (1)
- PYTHIA (1)
- Paging Algorithms (1)
- Parallel and SIMD calculations (1)
- Parallelism (1)
- Paramecium (1)
- Parameter estimation (1)
- Parkinson diagnosis (1)
- Parquet (1)
- Particle and Resonance Production (1)
- Particle correlations and fluctuations (1)
- Pathologists (1)
- Patternsprachen (1)
- Pb–Pb (1)
- Personalisierung (1)
- Personalization (1)
- Persönlichkeitsrecht (1)
- Phase Diagram of QCD (1)
- Phase-reset (1)
- Phosphate (1)
- Planning systems (1)
- Planungssystem (1)
- Planungssysteme (1)
- Plastizität (1)
- Plastizität <Physiologie> (1)
- PointNet (1)
- Polynomielles Wortproblem (1)
- Portabler Objektadapter (1)
- Portal Website (1)
- Pose Estimation (1)
- Positive fluid balance (1)
- Postoperative atrial fibrillation (1)
- Prag <1999> (1)
- Precongruence (1)
- Preface (1)
- Preßburg <2003> (1)
- Principal Component Analysis PCA (1)
- Principal Independent Component Analysis PICA (1)
- Principal component analysis (1)
- Prioritäten (1)
- Privacy (1)
- Private Information Retrieval (1)
- Probabilistically checkable proofs (1)
- Problem kürzester Superstrings (1)
- Production Cross Section (1)
- Prognose (1)
- Prognostische Validität (1)
- Program Transformations (1)
- Program Verification (1)
- Programmiersprachen (1)
- Programmkalküle (1)
- Programmkorrektheit (1)
- Programmverifikation (1)
- Properties of Hadrons (1)
- Prophet Inequalities (1)
- Proteins (1)
- Proton–proton (1)
- Präkongruenz (1)
- Präprozessierung (1)
- Psychometrische Güte (1)
- Public Key Cryptosystem (1)
- Public Parameter (1)
- Public-Key-Kryptosystem (1)
- Python (1)
- Q-modularity (1)
- Quadratic Residue (1)
- Quantitative Imaging (1)
- Quark Deconfinement (1)
- Quark Gluon Plasma (1)
- Quark Production (1)
- Quark gluon plasma (1)
- Quarkonium (1)
- Query Language (1)
- RBF-nets (1)
- RDBMS (1)
- RDF <Informatik> (1)
- RF development (1)
- RNA biology (1)
- RNA interference (1)
- RQL (1)
- Random Oracle (1)
- Random String (1)
- Randomized algorithms (1)
- Rapidity Range (1)
- Rate Distortion Theory (1)
- Rating Scale (1)
- Rating Scale Design (1)
- Rating System (1)
- Reaktivierung der Gedächtnisspuren (1)
- Real-time systems (1)
- Recht am eignenen Bild (1)
- Reduktionssystem (1)
- Regular Languages (1)
- Reguläre Sprachen (1)
- Reinforcement Learning (1)
- Relativistic heavy ion physics (1)
- RenderMan (1)
- Representation Problem (1)
- Resolution Parameter (1)
- Resonances (1)
- Retrievalsprache (1)
- Roboter (1)
- Robotics (1)
- Rubber extrusion (1)
- Rènyi mutual information (1)
- SHA-3 (1)
- SLAM (1)
- SLLL-reduction (1)
- SMASH (1)
- SORN (1)
- SPARQL (1)
- SQL-on-Hadoop (1)
- STDP (1)
- SVD-Zerlegung (1)
- SWRL (1)
- San Francisco (1)
- Santa Barbara (1)
- Saward (1)
- Schema, Informatik (1)
- Schlaf (1)
- Security (1)
- Security Parameter (1)
- Sehrinde (1)
- Seitenersetzungsstrategie (1)
- Selbstorganisation (1)
- Selbstorganisierende Karte (1)
- Selbstorganisierende Taskverteilung (1)
- Selection process (1)
- Self-Assessment (1)
- Self-Instruct (1)
- Self-organized eigenvector jets (1)
- Self-regulated learning (1)
- Semantik (1)
- Semantische Dienste (1)
- Semantisches Dienstgütemanagement (1)
- Semantisches Web (1)
- Sense-making (1)
- Sentiment (1)
- Sentiment-Analysis (1)
- Sequence analysis (1)
- Server (1)
- Service Level Management (SLM) (1)
- Shader (1)
- Shannon (1)
- Sharing (1)
- Short-lived particles (1)
- Shortest Common Superstring Problem (1)
- Sichere Antworten (1)
- Sicherungstechnik (1)
- Signaling pathway (1)
- Signature (1)
- Similarity (1)
- Simulation (1)
- Single Event Effects (1)
- Single electrons (1)
- Single muons (1)
- Smart Learning (1)
- Social behaviour (1)
- Software updates (1)
- SparkSQL (1)
- Specialized Information Service (1)
- Speicherbedarf (1)
- Spezifikation (1)
- Sprachtheorie (1)
- Stable reduction algorithm (1)
- Statistical Classification (1)
- Statistical classification (1)
- Stereo Vision (1)
- Stereophotographie (1)
- Stochastic Probing (1)
- Striktheitsanalyse (1)
- Student-facing learning analytics (1)
- Studienberatung (1)
- Studienleistungen (1)
- Studienwahl (1)
- Sumerian (1)
- Systematic Uncertainty (1)
- Systembiologie (1)
- Szenengenerierung (1)
- TIPS (1)
- TR (1)
- Table of Contents (1)
- Takens-Grassberger correlation integral (1)
- Technologie Enhanced Learning (1)
- Technology-Enhanced Learning (1)
- Telekommunikationsnetz (1)
- Telekommunikationswirtschaft (1)
- Termersetzungssystem (1)
- Termination (1)
- Terrmersetzungssystem (1)
- Testing (1)
- Text mining (1)
- Text2Scene (1)
- Texttechnologie (1)
- Textvisualisierung (1)
- Time Constraints (1)
- Time Projection Chamber (1)
- Tracking (1)
- Training (1)
- Transfer learning (1)
- Transform coding (1)
- Transinformation (1)
- Transition invariant (1)
- Transition radiation detector (1)
- Transjugular Intrahepatic Portosystemic Shunt (1)
- Translation (1)
- Transmembrane helix (1)
- Transmembrane sheets (1)
- Transverse momentum (1)
- Trapdoor (1)
- Trigger (1)
- Typical Learning Behaviour (1)
- UPT (1)
- Ubiquitous Computing (1)
- Umbenennung (1)
- Unabhängige Komponentenanalyse (1)
- Ungewissheit (1)
- Uniform resource locators (1)
- Unity (1)
- Universa feature extraxtion (1)
- Unterrichtsbeispiele (1)
- Unüberwachtes Lernen (1)
- User Interface (1)
- User Profile (1)
- VLSI (1)
- VR (1)
- VRML (1)
- Valve surgery (1)
- Vector Boson Production (1)
- Vectorization (1)
- Verdeckung (1)
- Verteilung (1)
- Visual (1)
- Visual object recognition (1)
- Voyeurism (1)
- Voyeurismus (1)
- Watermarking (1)
- Web (1)
- Web Analytics (1)
- Web Based Training (1)
- Web Search (1)
- Web application (1)
- Web-based Training (1)
- Wechselseitige Information (1)
- Wiki (1)
- Wissensbasiertes System (1)
- Workshop Organization (1)
- World wide web (1)
- Wortproblem (1)
- XML (1)
- Xenon-based gas mixture (1)
- Z-inspection (1)
- Zeichenkette (1)
- abstract reduction (1)
- acute infection (1)
- adaption (1)
- addition-invariant first-order logic (1)
- adequate translation (1)
- aging (1)
- algebraic closure properties (1)
- algorithms (1)
- alignment in communication structural coupling (1)
- alpha renaming (1)
- ambiguity (1)
- anaplastic large cell lymphoma (1)
- anatomy ontologies (1)
- approximation complexity (1)
- approximation networks (1)
- attention-based object recognition (1)
- automata (1)
- automatic handwriting analysis (1)
- average pairwise distance (1)
- big data (1)
- big data benchmarking (1)
- biochemical pathways (1)
- bisimulation (1)
- boutons (1)
- built-in self-test (1)
- calcium dynamics (1)
- call-by-need evaluation (1)
- call-by-need lambda calculus (1)
- cancer (1)
- cell motility (1)
- cellular automata (1)
- cellular neural nets (1)
- centrality (1)
- certain answers (1)
- chemokine receptors (1)
- chosen ciphertext attack (1)
- chronic infection (1)
- classical Hodgkin lymphoma (1)
- classification (1)
- clinical presentation (1)
- clique problem (1)
- closed world assumption (CWA) (1)
- cluster transformation (1)
- clustering (1)
- codon usage preferences (1)
- colorabdity (1)
- columnar file formats (1)
- combinatorics (1)
- common transition pairs (1)
- communication complexity (1)
- community (1)
- competence (1)
- complementary information (1)
- compression (1)
- computational geometry (1)
- computer vision (1)
- concurrent composition (1)
- continued fraction algorithm (1)
- cooperation (1)
- corpus study (1)
- correctness (1)
- coupled differential equations (1)
- coupon collector problem (1)
- course achievement (1)
- critically ill patients (1)
- dE/dx (1)
- dancing (1)
- data acquisition; high energy physics; FPGA; CBM; FLES (1)
- data analysis (1)
- data crowdsourcing (1)
- data exchange (1)
- data orthonormalization network (1)
- data quality (1)
- data science education (1)
- data streams (1)
- decidability questions (1)
- decidable characterisations (1)
- deduction (1)
- deductive database (1)
- deduktive Datenbank (1)
- deep learning (1)
- descriptional complexity (1)
- descriptive patterns (1)
- deskriptive Pattern (1)
- detailed modeling (1)
- detector (1)
- differential equations (1)
- digital literacy (1)
- digital pathology (1)
- digitale Kompetenz (1)
- discrete logarithm (1)
- discrete processing (1)
- diskrete Verarbeitung (1)
- dissemination (1)
- drahtlos (1)
- dynamic programming (1)
- e-Entropy (1)
- eHumanities (1)
- eLearning (1)
- eRQL (1)
- early warning signs (1)
- electrical stimulation (1)
- electronic pen (1)
- elementary mode (1)
- emergence (1)
- endlicher Index (1)
- epigenome (1)
- epileptogenesis (1)
- epistemic network analysis (1)
- error bounds (1)
- ethical co-design (1)
- ethics (1)
- evolutionary associative learning (1)
- experimental results (1)
- exponentiation (1)
- eye-tracking (1)
- families of hash functions (1)
- feature selection (1)
- feedforward network layers (1)
- finite index (1)
- finite model theory (1)
- firing pattern (1)
- first-order logic (1)
- floating point arithmetic (1)
- floating point errors (1)
- formal languages (1)
- formal semantics (1)
- fractions of exponentiation (1)
- functional module (1)
- futures (1)
- gamification (1)
- gamma Zyklus (1)
- gamma cycle (1)
- generatives Lernen (1)
- generic algorithm (1)
- generic group model (1)
- genetic algorithm (1)
- genotype–phenotype (1)
- grammar systems (1)
- grammar-based compression (1)
- graph algorithms (1)
- graph isomorphism (1)
- graph understanding (1)
- hard bit (1)
- hashing (1)
- haskell (1)
- hawkes processes (1)
- healthcare (1)
- heavy ion collisions (1)
- heavy ion experiments (1)
- heterogeneity (1)
- hierarchies and reducibilities (1)
- higher education (1)
- highly regular nearby points (1)
- homeostasis (1)
- host-parasite population dynamics (1)
- human lymph node (1)
- human viruses (1)
- hybrid (1)
- image analysis (1)
- image databases (1)
- image encoding (1)
- immune response (1)
- immune system (1)
- impact parameter (1)
- incremental schemes (1)
- inductive inference (1)
- information conservation (1)
- information decomposition (1)
- information distribution (1)
- information landscape (1)
- inner product (1)
- integer points (1)
- integer relation (1)
- integer vector (1)
- intertextual similarity (1)
- intratextual similarity (1)
- intrinsic plasticity (1)
- invariant transition pairs (1)
- invasion probability (1)
- invasion time (1)
- iterated subsegments (1)
- iterative arrays (1)
- kinetic fingerprint (1)
- knapsack cryptosystems (1)
- knowledge area (1)
- knowledge graphs (1)
- kontextabhängige Verarbeitung (1)
- kontextuelle Gleichheit (1)
- lattice basis reduction (1)
- lattices (1)
- learning goal (1)
- learning unit (1)
- length defect (1)
- linguistic linked open data (1)
- linguistic networks graph distance measures (1)
- linguistic relativity (1)
- linked open data (1)
- literature digitization (1)
- local LLL-reduction (1)
- local LLLreduction (1)
- local coordinates (1)
- local randomness (1)
- logic (1)
- logic synthesis (1)
- logical interpretations (1)
- logical networks (1)
- low-resource languages (1)
- lymph node (1)
- machine learning (1)
- machine models (1)
- macronucleus (1)
- malignant melanoma (1)
- mathematical modeling (1)
- mathematical models of viral RNA cycle (1)
- matroids, online algorithm (1)
- maximal common transition set (1)
- maximal information gain (1)
- meta languages (1)
- metabolic networks (1)
- metalinear (1)
- microarrays (1)
- minimal cut set (1)
- minimum description length (1)
- minimum entropy (1)
- mitochondria (1)
- model parameter adaption (1)
- model verification (1)
- modeling (1)
- modeling and simulation (1)
- models of computation (1)
- morphological filtering (1)
- multiple correspondence analysis (1)
- multiple texts (1)
- mutation (1)
- mutual information (1)
- mutual information of graphs (1)
- network model (1)
- network reduction (1)
- network similarity measurement (1)
- neural nets (1)
- neural network (1)
- neuromuscular junction (1)
- neuron (1)
- neuronal network (1)
- newspaper (1)
- noise suppression (1)
- nominal unification (1)
- non-commercial publishing (1)
- non-malleability (1)
- nondeterministic finite automata (1)
- nondetermmistlc Turing machines (1)
- normalization (1)
- ntracellular signaling (1)
- observational equivalence (1)
- off-line memory reprocessing (1)
- one-more decryption attack (1)
- one-way function (1)
- one-way functions (1)
- open access (1)
- optimization (1)
- ordinary differential equation (1)
- organic computing (1)
- overfitting (1)
- packing problem (1)
- parallel (1)
- parallel processes (1)
- parliamentary debate (1)
- parsing (1)
- partial differential equation (1)
- pattern languages (1)
- phage (1)
- phage therapy (1)
- plasticity (1)
- polynomial random number generator (1)
- polynomial word problem (1)
- poröses Medium (1)
- postrelational database (1)
- postrelationale Datenbank (1)
- precongruence (1)
- prediction quality (1)
- predictive validity (1)
- principal component analysis (1)
- process approximation (1)
- program correctness (1)
- programming calculi (1)
- programming languages design (1)
- psychometric properties (1)
- public speaking (1)
- quark gluon plasma (1)
- quicksort (1)
- random function generator (1)
- random geometric graph (1)
- random hyperbolic graph generator (1)
- random number generator (1)
- random oracle model (1)
- randomized algorithms (1)
- rate-distortion theory (1)
- reaction-diffusion systems (1)
- reactive systems (1)
- reception (1)
- redundancy (1)
- redundant information (1)
- regular tree languages (1)
- relative termination (1)
- representation (1)
- representative claims (1)
- resistance (1)
- restricted Hebbian learning (1)
- reward-dependent learning (1)
- rewriting systems (1)
- rosetting T cells (1)
- salsa (1)
- satlsfiablhty (1)
- scale-invariant object model (1)
- secretary problem (1)
- secure bit (1)
- security analysis of protocols (1)
- security of data (1)
- segmentation (1)
- semantic web (1)
- sensor-based learning support (1)
- sharing (1)
- shock filter (1)
- short integer relation (1)
- shortest lattice vector (1)
- signature size (1)
- signed ElGamal encryption (1)
- similarity (1)
- simultaneous diophantine approximations (1)
- simultaneous security of bits (1)
- single block replacement (1)
- small RNA (1)
- social media (1)
- sorting (1)
- space bounded computations (1)
- space improvements (1)
- space optimization (1)
- sparse coding (1)
- spatial host population structure (1)
- specialized vocabulary (1)
- specification and verification (1)
- spectra (1)
- storage optimization (1)
- straight line programs (1)
- streaming algorithm (1)
- strictness analysis (1)
- string rewriting (1)
- stroke (1)
- structure-function relationships (1)
- subset sum problems (1)
- substitution attacks (1)
- succinct data structures (1)
- succinctness (1)
- surface approximation (1)
- synapse (1)
- synaptic normalization (1)
- synergistic interaction (1)
- synergy (1)
- syntax (1)
- systems biology (1)
- t-cluster (1)
- t-invariant (1)
- tailored learning path (1)
- termination (1)
- testability (1)
- text mining tools (1)
- text search (1)
- textbooks (1)
- the set disjointness problem (1)
- theory of computation (1)
- three-level topic model (1)
- threshold concepts (1)
- trajectories (1)
- transition invariant (1)
- translation (1)
- translational selection (1)
- tree grammars (1)
- trustworthy AI (1)
- trustworthy AI Co-design (1)
- uncertainty (1)
- unique information (1)
- variability (1)
- verzögerte Auswertung (1)
- volatility clustering (1)
- volume-visualization (1)
- warts (1)
- weight resolutions (1)
- whitening filter (1)
- whole slide image (1)
- wikipedia (1)
- wireless business model pyramid scheme multi-level (1)
- within-host viral modeling (1)
- within-host viral modelling (1)
- women’s quota (1)
- xAPI (1)
- √sN N = 2.76 TeV (1)
Institute
- Informatik (1645)
- Frankfurt Institute for Advanced Studies (FIAS) (1034)
- Physik (1012)
- Mathematik (56)
- Präsidium (41)
- Medizin (25)
- Biowissenschaften (21)
- Exzellenzcluster Makromolekulare Komplexe (8)
- Psychologie (8)
- Deutsches Institut für Internationale Pädagogische Forschung (DIPF) (5)
Let G be a finite cyclic group with generator \alpha and with an encoding so that multiplication is computable in polynomial time. We study the security of bits of the discrete log x when given \exp_{\alpha}(x), assuming that the exponentiation function \exp_{\alpha}(x) = \alpha^x is one-way. We reduce he general problem to the case that G has odd order q. If G has odd order q the security of the least-significant bits of x and of the most significant bits of the rational number \frac{x}{q} \in [0,1) follows from the work of Peralta [P85] and Long and Wigderson [LW88]. We generalize these bits and study the security of consecutive shift bits lsb(2^{-i}x mod q) for i=k+1,...,k+j. When we restrict \exp_{\alpha} to arguments x such that some sequence of j consecutive shift bits of x is constant (i.e., not depending on x) we call it a 2^{-j}-fraction of \exp_{\alpha}. For groups of odd group order q we show that every two 2^{-j}-fractions of \exp_{\alpha} are equally one-way by a polynomial time transformation: Either they are all one-way or none of them. Our key theorem shows that arbitrary j consecutive shift bits of x are simultaneously secure when given \exp_{\alpha}(x) iff the 2^{-j}-fractions of \exp_{\alpha} are one-way. In particular this applies to the j least-significant bits of x and to the j most-significant bits of \frac{x}{q} \in [0,1). For one-way \exp_{\alpha} the individual bits of x are secure when given \exp_{\alpha}(x) by the method of Hastad, N\"aslund [HN98]. For groups of even order 2^{s}q we show that the j least-significant bits of \lfloor x/2^s\rfloor, as well as the j most-significant bits of \frac{x}{q} \in [0,1), are simultaneously secure iff the 2^{-j}-fractions of \exp_{\alpha'} are one-way for \alpha' := \alpha^{2^s}. We use and extend the models of generic algorithms of Nechaev (1994) and Shoup (1997). We determine the generic complexity of inverting fractions of \exp_{\alpha} for the case that \alpha has prime order q. As a consequence, arbitrary segments of (1-\varepsilon)\lg q consecutive shift bits of random x are for constant \varepsilon >0 simultaneously secure against generic attacks. Every generic algorithm using $t$ generic steps (group operations) for distinguishing bit strings of j consecutive shift bits of x from random bit strings has at most advantage O((\lg q) j\sqrt{t} (2^j/q)^{\frac14}).
We present a novel practical algorithm that given a lattice basis b1, ..., bn finds in O(n exp 2 *(k/6) exp (k/4)) average time a shorter vector than b1 provided that b1 is (k/6) exp (n/(2k)) times longer than the length of the shortest, nonzero lattice vector. We assume that the given basis b1, ..., bn has an orthogonal basis that is typical for worst case lattice bases. The new reduction method samples short lattice vectors in high dimensional sublattices, it advances in sporadic big jumps. It decreases the approximation factor achievable in a given time by known methods to less than its fourth-th root. We further speed up the new method by the simple and the general birthday method. n2
We enhance the security of Schnorr blind signatures against the novel one-more-forgery of Schnorr [Sc01] andWagner [W02] which is possible even if the discrete logarithm is hard to compute. We show two limitations of this attack. Firstly, replacing the group G by the s-fold direct product G exp(×s) increases the work of the attack, for a given number of signer interactions, to the s-power while increasing the work of the blind signature protocol merely by a factor s. Secondly, we bound the number of additional signatures per signer interaction that can be forged effectively. That fraction of the additional forged signatures can be made arbitrarily small.
We modify the concept of LLL-reduction of lattice bases in the sense of Lenstra, Lenstra, Lovasz [LLL82] towards a faster reduction algorithm. We organize LLL-reduction in segments of the basis. Our SLLL-bases approximate the successive minima of the lattice in nearly the same way as LLL-bases. For integer lattices of dimension n given by a basis of length 2exp(O(n)), SLLL-reduction runs in O(n.exp(5+epsilon)) bit operations for every epsilon > 0, compared to O(exp(n7+epsilon)) for the original LLL and to O(exp(n6+epsilon)) for the LLL-algorithms of Schnorr (1988) and Storjohann (1996). We present an even faster algorithm for SLLL-reduction via iterated subsegments running in O(n*exp(3)*log n) arithmetic steps.
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely on basis reduction algorithms to find short nonzero vectors in special lattices. The Lagarias-Odlyzko algorithm would solve almost all subset sum problems of density < 0.6463 . . . in polynomial time if it could invoke a polynomial-time algorithm for finding the shortest non-zero vector in a lattice. This paper presents two modifications of that algorithm, either one of which would solve almost all problems of density < 0.9408 . . . if it could find shortest non-zero vectors in lattices. These modifications also yield dramatic improvements in practice when they are combined with known lattice basis reduction algorithms.
We present a novel parallel one-more signature forgery against blind Okamoto-Schnorr and blind Schnorr signatures in which an attacker interacts some times with a legitimate signer and produces from these interactions signatures. Security against the new attack requires that the following ROS-problem is intractable: find an overdetermined, solvable system of linear equations modulo with random inhomogenities (right sides). There is an inherent weakness in the security result of POINTCHEVAL AND STERN. Theorem 26 [PS00] does not cover attacks with 4 parallel interactions for elliptic curves of order 2200. That would require the intractability of the ROS-problem, a plausible but novel complexity assumption. Conversely, assuming the intractability of the ROS-problem, we show that Schnorr signatures are secure in the random oracle and generic group model against the one-more signature forgery.
We present a practical algorithm that given an LLL-reduced lattice basis of dimension n, runs in time O(n3(k=6)k=4+n4) and approximates the length of the shortest, non-zero lattice vector to within a factor (k=6)n=(2k). This result is based on reasonable heuristics. Compared to previous practical algorithms the new method reduces the proven approximation factor achievable in a given time to less than its fourthth root. We also present a sieve algorithm inspired by Ajtai, Kumar, Sivakumar [AKS01].
Mit dem World Wide Web sind der Bestand und die Verfügbarkeit von Informationen rapide angewachsen. Der Einzelne hat Schwierigkeiten, der Menge an Informationen und Wissen Herr zu werden und so der Informationsüberflutung zu begegnen. Dieses Problem wurde von Forschern und Technikern bereits frühzeitig erkannt und durch verschiedene Konzepte wie die intelligente Suche und die Klassifikation von Informationen zu lösen versucht. Ein weiteres Konzept ist die Personalisierung, die das bedarfsgerechte Zuschneiden von Informationen auf die Bedürfnisse des einzelnen Anwenders zum Ziel hat. Diese Arbeit beschreibt dazu eine Reihe von Personalisierungstechniken und im Speziellen das Kollaborative Filtern als eine dieser Techniken. Bestehende Schwächen des Kollaborativen Filterns wie zu dünn besetzte Benutzerprofile und das mangelnde Erkennen von Änderungen im Benutzerinteresse im Verlauf der Zeit werden durch verschiedene Ansätze zu entschärfen versucht. Dazu wird eine Kombination mit Inhaltsbasierten Filtern und die Verbreiterung der Datenbasis bewerteter Ressourcen betrieben. Ziel ist die Optimierung der Personalisierung, so dass Anwender besser auf sie abgestimmte Informationen erhalten. Ein Teil der beschriebenen Ansätze wird zudem in einem prototypischen Informationssystem umgesetzt, um die Machbarkeit und den Nutzen zu prüfen. Dazu werden der auf der Java 2 Enterprise Edition aufbauende WebSphere Applikationsserver von IBM und die relationale Datenbank DB2 UDB aus gleichem Hause eingesetzt.