the proceedings contain 66 papers. the topics discussed include: quantum random walks-new method for designing quantum algorithms;social information access: the other side of the social web;designing adaptive web appl...
详细信息
ISBN:
(纸本)354077565X
the proceedings contain 66 papers. the topics discussed include: quantum random walks-new method for designing quantum algorithms;social information access: the other side of the social web;designing adaptive web applications;best of both: using semantic web technologies to enrich user interaction withthe web and vice versa;on the hardness of reoptimization;describing self-assembly of nanostructures;on the undecidability of the tiling problem;remote entrusting by run-time software authentication;trusted computing-special aspects and challenges;optimizing winning strategies in regular infinite games;recursive domain equations of filter models;algorithmic problems for metrics on permutation groups;and periodic and infinite traces in matrix semigroups.
the proceedings contain 50 papers. the special focus in this conference is on currenttrends in theory and practice of computerscience. the topics include: Parameterized Complexity of Feedback Vertex Set with...
ISBN:
(纸本)9783031826696
the proceedings contain 50 papers. the special focus in this conference is on currenttrends in theory and practice of computerscience. the topics include: Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints;online b-Matching with Stochastic Rewards;shortest Longest-Path Graph Orientations for Trees;parameterized Complexity of Generalizations of Edge Dominating Set;beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking;on the Complexity of Minimum Membership Dominating Set;on the Structural Parameterized Complexity of Defective Coloring;Dynamic Range Minimum Queries on the Ultra-wide Word RAM;fast Practical Compression of Deterministic Finite Automata;orienteering (with Time Windows) on Restricted Graph Classes;massively Parallel Maximum Coverage Revisited;distance Vector Domination;sufficient Conditions for Polynomial-Time Detection of Induced Minors;pathways to Tractability for Geometric thickness;minimum Monotone Spanning Trees;representing Hypergraphs by Point-Line Incidences;reachability in Temporal Graphs Under Perturbation;on Computational Completeness of Semi-Conditional Matrix Grammars;Outer-(ap)RAC Graphs;forest Covers and Bounded Forest Covers;multi-agent Search-Type Problems on Polygons: (Extended Abstract);generation of Cycle Permutation Graphs and Permutation Snarks;expected Density of Random Minimizers.
the proceedings contain 50 papers. the special focus in this conference is on currenttrends in theory and practice of computerscience. the topics include: Parameterized Complexity of Feedback Vertex Set with...
ISBN:
(纸本)9783031826962
the proceedings contain 50 papers. the special focus in this conference is on currenttrends in theory and practice of computerscience. the topics include: Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints;online b-Matching with Stochastic Rewards;shortest Longest-Path Graph Orientations for Trees;parameterized Complexity of Generalizations of Edge Dominating Set;beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking;on the Complexity of Minimum Membership Dominating Set;on the Structural Parameterized Complexity of Defective Coloring;Dynamic Range Minimum Queries on the Ultra-wide Word RAM;fast Practical Compression of Deterministic Finite Automata;orienteering (with Time Windows) on Restricted Graph Classes;massively Parallel Maximum Coverage Revisited;distance Vector Domination;sufficient Conditions for Polynomial-Time Detection of Induced Minors;pathways to Tractability for Geometric thickness;minimum Monotone Spanning Trees;representing Hypergraphs by Point-Line Incidences;reachability in Temporal Graphs Under Perturbation;on Computational Completeness of Semi-Conditional Matrix Grammars;Outer-(ap)RAC Graphs;forest Covers and Bounded Forest Covers;multi-agent Search-Type Problems on Polygons: (Extended Abstract);generation of Cycle Permutation Graphs and Permutation Snarks;expected Density of Random Minimizers.
the proceedings contain 42 papers. the topics discussed include: theory of multi core hypervisor verification;software components in computer assisted living?;engineering algorithms for large data sets;core stability ...
ISBN:
(纸本)9783642358425
the proceedings contain 42 papers. the topics discussed include: theory of multi core hypervisor verification;software components in computer assisted living?;engineering algorithms for large data sets;core stability in hedonic coalition formation;software production: a new paradigm for software engineering research;a model of the commit size distribution of open source;ISICIL: semantics and social networks for business intelligence;a multi-dimensional comparison of ontology design patterns for representing n-ary relations;cognition-enabled autonomous robot control for the realization of home chore task intelligence;searching things in large sets of images;worst case analysis of non-local games;two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory;and flow decompositions in external memory.
the proceedings contain 34 papers. the special focus in this conference is on currenttrends in theory and practice of computerscience. the topics include: Algorithms and Turing Kernels for Detecting and Countin...
ISBN:
(纸本)9783031521126
the proceedings contain 34 papers. the special focus in this conference is on currenttrends in theory and practice of computerscience. the topics include: Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs;query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages;row-Column Combination of Dyck Words;group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures;on the Parameterized Complexity of the Perfect Phylogeny Problem;data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles;visualization of Bipartite Graphs in Limited Window Size;outerplanar and Forest Storyplans;word-Representable Graphs from a Word’s Perspective;the Information Extraction Framework of Document Spanners - A Very Informal Survey;automata Classes Accepting Languages Whose Commutative Closure is Regular;complexity of Spherical Equations in Finite Groups;the Weighted HOM-Problem Over Fields;combinatorics of Block-Parallel Automata Networks;on the Computational Complexity of Generalized Common Shape Puzzles;new Support Size Bounds and Proximity Bounds for Integer Linear Programming;the Complexity of Cluster Vertex Splitting and Company;morphing Graph Drawings in the Presence of Point Obstacles;the Complexity of Online Graph Games;removable Online Knapsack with Bounded Size Items;shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching;generalized Distance Polymatrix Games;distance Labeling for Families of Cycles;relaxed Agreement Forests;apportionment withthresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode;positive Characteristic Sets for Relational Pattern Languages;on the Parameterized Complexity of Minus Domination;preface;local Certification of Majority Dynamics;parameterized Algorithms for Covering by Arithmetic Progressions;faster Winner Determination Algo
the proceedings contain 53 papers. the topics discussed include: the legacy of turing in numerical analysis;turing machines for dummies: why representations do matter;what is an algorithm?;strong bridges and strong ar...
ISBN:
(纸本)9783642276590
the proceedings contain 53 papers. the topics discussed include: the legacy of turing in numerical analysis;turing machines for dummies: why representations do matter;what is an algorithm?;strong bridges and strong articulation points of directed graphs;towards computational models of artificial cognitive systems that can, in principle, pass the turing test;a fully generic approach for realizing the adaptive web;multi feature indexing network Mufin for similarity search applications;recent challenges and ideas in temporal synthesis;cryptography from learning parity with noise;a quick tour of word sense disambiguation, induction and related approaches;not another look at the turing test!;the equational theory of weak complete simulation semantics over BCCSP;complexity insights of the minimum duplication problem;and unique-maximum and conflict-free coloring for hypergraphs and tree graphs.
the proceedings contain 45 papers. the topics discussed include: open services for software process compliance engineering;towards a higher-dimensional string theory for the modeling of computerized systems;advice com...
ISBN:
(纸本)9783319042978
the proceedings contain 45 papers. the topics discussed include: open services for software process compliance engineering;towards a higher-dimensional string theory for the modeling of computerized systems;advice complexity: quantitative approach to a-priori information;matching of images of non-planar objects with view synthesis;agile requirements engineering: a research perspective;fitting planar graphs on planar maps;minimum activation cost node-disjoint paths in graphs with bounded treewidth;tight bounds for the advice complexity of the online minimum Steiner tree problem;on the power of advice and randomization for the disjoint path allocation problem;goal-based establishment of an information security management system compliant to ISO 27001;platform independent software development monitoring: design of an architecture;and towards unlocking the full potential of multileaf collimators.
the proceedings contain 64 papers. the topics discussed include: forcing monotonicity in parameterized verification: from multisets to words;essential performance drivers in native XML DBMSs;continuous processing of p...
ISBN:
(纸本)3642050050
the proceedings contain 64 papers. the topics discussed include: forcing monotonicity in parameterized verification: from multisets to words;essential performance drivers in native XML DBMSs;continuous processing of preference queries in data streams;clock synchronization: open problems in theory and practice;lessons in software evolution learned by listening to smalltalk;model-driven software product line testing: an integrated approach;a rule format for unit elements;approximability of edge matching puzzles;a linear time algorithm for finding three edge-disjoint paths in Eulerian networks;R-programs: a framework for distributing XML structural joins across function calls;fast arc-annotated subsequence matching in linear space;a kernel for convex recoloring of weighted forests;symbolic OBDD-based reachability analysis needs exponential space;and a social vision of knowledge representation and reasoning.
the proceedings contain 45 papers. the topics discussed include: integrity and consistency for untrusted services;a structured codesign approach to many-core architectures for embedded systems;efficient algorithms for...
ISBN:
(纸本)9783642183805
the proceedings contain 45 papers. the topics discussed include: integrity and consistency for untrusted services;a structured codesign approach to many-core architectures for embedded systems;efficient algorithms for handling nondeterministic automata;tracking the evolution of code clones;liquidsoap: a high-level programming language for multimedia streaming;combining traditional map labeling with boundary labeling;on making a distinguished vertex minimum degree by vertex deletion;sequential optimization of matrix chain multiplication relative to different cost functions;collisionless gathering of robots with an extent;min-max coverage in multi-interface networks;bandwidth constrained multi-interface networks;cooperative query answering by abstract interpretation;a power consumption analysis technique using UML-based design models in embedded software development;and advice complexity and barely random algorithms.
the proceedings contain 26 papers. the special focus in this conference is on currenttrends in theory and practice of computerscience. the topics include: Learning through Imitation by Using Formal Verification...
ISBN:
(纸本)9783031231001
the proceedings contain 26 papers. the special focus in this conference is on currenttrends in theory and practice of computerscience. the topics include: Learning through Imitation by Using Formal Verification;quantum Complexity for Vector Domination Problem;A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints;lower Bounds for Monotone q-Multilinear Boolean Circuits;a Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs;multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs;payment Scheduling in the Interval Debt Model;introduction to Routing Problems with Mandatory Transitions;on the Preservation of Properties When Changing Communication Models;sequentially Swapping Tokens: Further on Graph Classes;on the 2-Layer Window Width Minimization Problem;on the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines;balanced Substructures in Bicolored Graphs;on the Parameterized Complexity of s-club Cluster Deletion Problems;heuristics for Opinion Diffusion via Local Elections;the Complexity of Finding Tangles;preface;parameterized Approaches to Orthogonal Compaction;hardness of Bounding Influence via Graph Modification;visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees;morphing Planar Graph Drawings through 3D;Dominance Drawings for DAGs with Bounded Modular Width;more Effort Towards Multiagent Knapsack;solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth.
暂无评论