Obsah: “…Introduction -- Problem definition -- Methodology for safe trajectory planning -- Deterministic algorithms -- Non-deterministic algorithms -- Registration of navigational data -- Evaluation of algorithms.…”
Click for online access

Obsah: “…A Tour through Networking and Grids -- Fundamental Stochastic Models -- Queueing Models -- Fundamental Deterministic Algorithms -- Divisible Load Modeling for Grids.…”
Click to view e-book

Obsah: “…Introduction -- A Tour through Networking and Computing -- Fundamental Stochastic Models -- Queueing Models -- Fundamental Deterministic Algorithms -- Divisible Load Modeling for Grids -- Amdahls and Related Laws -- Machine Learning for Networking -- Conclusion.…”
Click for online access

Obsah: “…Part I: Introduction to Stochastic Recursive Algorithms -- Introduction -- Deterministic Algorithms for Local Search -- Stochastic Approximation Algorithms -- Part II: Gradient Estimation Schemes -- Kiefer-Wolfowitz Algorithm -- Gradient Schemes with Simultaneous Perturbation Stochastic Approximation -- Smoothed Functional Gradient Schemes -- Part III: Hessian Estimation Schemes -- Hessian Estimation with Simultaneous Perturbation Stochasti Approximation -- Smoothed Functional Hessian Schemes -- Part IV: Variations to the Basic Scheme -- Discrete Optimization -- Algorithms for Contrained Optimization -- Reinforcement Learning -- Part V: Applications -- Service Systems -- Road Traffic Control -- Communication Networks.…”
Click to view e-book

Click to view e-book

Obsah: “…An Empirical Study on the Adoption of Agile Software Development in Public Organizations -- Using Agile Methods in Distributed Software Development Environments -- Gamification Use in Agile Project Management -- Application of Scrum Maturity Model in Softdesign Company -- Modeling in Agile Software Development -- Strategies for Reducing Technical Debt in Agile Teams -- ReTest: Framework for Applying TDD in the Development of Non-deterministic Algorithms -- Validation Board: Invalidating Ideas and Discovering the Problems that Must be Solved -- IBM Design Thinking Software Development Framework -- SimKan: training Kanban practices through stochastic simulation -- Predicting the Unpredictable: Using Monte Carlo Simulation to Predict Project Completion Date -- Scrum Hero: Gamifying the Scrum Framework -- Motivating Factors In Agile and Traditional Software Development Methods -- Quality Assurance in Agile Software Development.…”
Click to view e-book

Obsah: “…Part I: Distributed Rendezvous Theory -- Chapter 1 Distributed Systems -- Chapter 2 Rendezvous Theory and Its Applications -- Part II: Blind Rendezvous in Distributed Systems -- Chapter 3 The Blind Rendezvous Problem -- Chapter 4 Global Sequence Based Rendezvous Algorithms -- Chapter 5 Local Sequence Based Rendezvous Algorithms -- Part III: Oblivious Blind Rendezvous in Distributed Systems -- Chapter 6 The Oblivious Blind Rendezvous Problem -- Chapter 7 Randomized Algorithms for Anonymous Users -- Chapter 8 Deterministic Algorithms for Non-anonymous Users -- Chapter 9 Fully Distributed Rendezvous Algorithms -- Part IV: Distributed Rendezvous Applications -- Chapter 10 Rendezvous in Cognitive Radio Networks -- Chapter 11 Rendezvous Search in Graphs -- Chapter 12 Rendezvous Games -- Part V: Conclusions and Future Works -- Chapter 13 Conclusions and Future Works.…”
Click to view e-book

Click to view e-book

Obsah: “…Approaching Set Cover Leasing, Connected Dominating Set and Related Problems with Online Deterministic Algorithms -- Enabling Risk-averse Dispatch Processes for Transportation Network Companies by Probabilistic Location Prediction -- Solving the Robust Vehicle Routing Problem using the Worst Feasible Scenario Strategy -- Selected Approximate Approaches to Robust Emergency Service System Design -- Learning-based Prediction of Conditional Wait Time Distributions in Multiskill Call Centers -- Reporting and Comparing Rates of Personnel Flow -- Scenario-based Optimization of Specific Group of Public Service Systems in Health Sector -- Project Selection with Uncertainty using Monte Carlo Simulation and Multi-criteria Decision Methods -- Finite-horizon and Infinite-horizon Markov Decision Processes with Trapezoidal Fuzzy Discounted Rewards -- The Optimal Stopping Criteria for a Customer Contact Strategy in Targeted Marketing -- A MIP-based Heuristic for Pickup and Delivery on Rectilinear Layout.…”
Click for online access

Click to view e-book

Click to view e-book

Obsah: “…Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. …”
Click to view e-book

Obsah: “…Optimization under Explorable Uncertainty: Adversarial and Stochastic Models -- Approximation Ineffectiveness of a Tour-Untangling Heuristic -- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling with Explorable Uncertainty -- Total Completion Time Scheduling Under Scenarios -- Approximating Fair k-Min-Sum-Radii in Euclidean Space -- Online hitting set of d-dimensional fat objects -- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes -- Hitting Sets when the Shallow Cell Complexity is Small -- Any-Order Online Interval Selection -- Improved Approximations for Relative Survivable Network Design -- Independent set in k-Claw-Free Graphs: Conditional -boundedness and the Power of LP/SDP Relaxations -- Fast Parallel Algorithms for Submodular p-Superseparable Maximization.…”
Click for online access

Click to view e-book

Click to view e-book

Click to view e-book

Obsah: “…Improved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems.…”
Click to view e-book

Obsah: “…Invited Papers -- Trakhtenbrot Theorem and Fuzzy Logic -- Descriptive Complexity, Lower Bounds and Linear Time -- Testing of Finite State Systems -- Contributed Papers -- On the Power of Quantifiers in First-Order Algebraic Specification -- On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases -- Revision Programming = Logic Programming + Integrity Constraints -- Quantifiers and the System KE: Some Surprising Results -- Choice Construct and Lindström Logics -- Monadic NP and Graph Minors -- Invariant Definability and P/poly -- Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures -- An Upper Bound for Minimal Resolution Refutations -- On an Optimal Deterministic Algorithm for SAT -- Characteristic Properties of Majorant-Computability Over the Reals -- Theorems of Péter and Parsons in Computer Programming -- Kripke, Belnap, Urquhart and Relevant Decidability & Complexity -- Existence and Uniqueness of Normal Forms in Pure Type Systems with ??…”
Click to view e-book

Obsah: “…Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations -- Improved Lower Bounds for Non-utilitarian Truthfulness -- Buyer-Supplier Games: Optimization over the Core -- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines -- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays -- Online Algorithm for Parallel Job Scheduling and Strip Packing -- Geometric Spanners with Small Chromatic Number -- Approximating Largest Convex Hulls for Imprecise Points -- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem -- Covering the Edges of Bipartite Graphs Using K 2,2 Graphs -- On Min-Max r-Gatherings -- On the Max Coloring Problem -- Full and Local Information in Distributed Decision Making -- The Minimum Substring Cover Problem -- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Online Unit Clustering Problem -- Better Bounds for Incremental Medians -- Minimum Weighted Sum Bin Packing -- Approximation Schemes for Packing Splittable Items with Cardinality Constraints -- A Randomized Algorithm for Two Servers in Cross Polytope Spaces -- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems -- Online Rectangle Filling.…”
Click to view e-book

Click for online access

Obsah: “…tt SN (NP) distinguishes robust many-one and Turing completeness -- Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy -- On the drift of short schedules -- On removing non-degeneracy assumptions in computational geometry -- Maintaining maxima under boundary updates -- An optimal algorithm for one-separation of a set of isothetic polygons -- Nice drawings for planar bipartite graphs -- Area requirement of Gabriel drawings (extended abstract) -- Design of reliable combinatorial algorithms using certificates -- An improved deterministic algorithm for generalized random sampling -- Polynomial time algorithms for some self-duality problems -- A note on updating suffix tree labels -- Relaxed balanced red-black trees -- The algorithmic complexity of chemical threshold testing -- A meticulous analysis of mergesort programs -- BSP-like external-memory computation -- Topological chaos for elementary cellular automata -- On the complexity of balanced Boolean functions -- On sets with easy certificates and the existence of one-way permutations -- Isomorphism for graphs of bounded distance width -- Hardness of approximating problems on cubic graphs -- Tree contractions and evolutionary trees.…”
Click to view e-book

Obsah: “…Simple Deterministic Algorithms for Generating “Good" Musical Rhythms.- A Hierarchy for BPP log based on Counting Calls to an Oracle.- On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism -- On the Microscopic View of Time and Messages -- Descriptional Complexity of Error Detection.…”
Click to view e-book

Obsah: “…On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism -- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem -- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk -- On the Galois Lattice of Bipartite Distance Hereditary Graphs -- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance -- Border Correlations, Lattices and the Subgraph Component Polynomial -- Computing Minimum Length Representations of Sets of Words of Uniform Length -- Computing Primitively-Rooted Squares and Runs in Partial Words -- 3-coloring triangle-free planar graphs with a precolored 9-cycle -- Computing Heat Kernel Pagerank and a Local Clustering Algorithm -- Solving Matching Problems Efficiently in Bipartite Graphs -- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras -- On decomposing the complete graph into the union of two disjoint cycles -- Reconfiguration of Vertex Covers in a Graph -- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory -- On Maximum Common Subgraph Problems in Series-Parallel Graphs -- Profile-based optimal matchings in the Student/Project Allocation Problem -- The Min-Max Edge q-Coloring Problem -- Speeding up Graph Algorithms via Switching Classes -- Metric Dimension for Amalgamations of Graphs -- Deterministic Algorithms for the Independent Feedback Vertex Set Problem -- Lossless seeds for searching short patterns with high error rates.…”
Click to view e-book

Obsah: “…Functional classes under consideration -- 3. Classes of deterministic algorithms -- 4. Minimax concept of optimality and specific notions of optimality -- 5. …”
Click to view e-book

Obsah: “…Invited Papers -- When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity -- Approximation Schemes for Geometric NP-Hard Problems: A Survey -- On Clustering Using Random Walks -- An Introduction to Decidability of DPDA Equivalence -- Semidefinite Programming Based Approximation Algorithms -- Contributed Papers -- Hard Sets and Pseudo-random Generators for Constant Depth Circuits -- The First-Order Isomorphism Theorem -- Thresholds and Optimal Binary Comparison Search Trees -- Distributed LTL Model Checking Based on Negative Cycle Detection -- Computability and Complexity Results for a Spatial Assertion Language for Data Structures -- Using Nondeterminism to Design Efficient Deterministic Algorithms -- Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter -- A Mechanically Verified Compiling Specification for a Lisp Compiler -- Beyond Regular Model Checking -- Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity -- Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel -- List Decoding from Erasures: Bounds and Code Constructions -- Verification of a Leader Election Algorithm in Timed Asynchronous Systems -- Efficient Addition on Field Programmable Gate Arrays -- The Directed Minimum-Degree Spanning Tree Problem -- I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems -- Beyond Message Sequence Graphs -- Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints -- Properties of Distributed Timed-Arc Petri Nets -- From Falsification to Verification -- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems -- Range Allocation for Equivalence Logic -- Rewrite Closure for Ground and Cancellative AC Theories.…”
Click to view e-book

Obsah: “…Circuit complexity before the dawn of the new millennium -- A lambda calculus with letrecs and barriers -- Tables -- Mechanized formal methods: Progress and prospects -- The parameter space of the d-step conjecture -- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees -- Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles -- Weak bisimulation and model checking for Basic Parallel Processes -- Testing processes for efficiency -- Regularity is decidable for normed PA processes in polynomial time -- Dynamic maintenance of shortest path trees in simple polygons -- Close approximations of minimum rectangular coverings -- A new competitive algorithm for agent searching in unknown streets -- On the design of hybrid control systems using automata models -- Constraint retraction in FD -- Winskel is (almost) right -- An optimal deterministic algorithm for online b-matching -- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems -- Complexity of the gravitational method for linear programming -- Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errors -- Minimal relative normalization in orthogonal expression reduction systems -- Trace consistency and inevitability -- Finite state implementations of knowledge-based programs -- Higher-order proof by consistency -- Advocating ownership -- Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits -- Limitations of the QRQW and EREW PRAM models -- Pinpointing computation with modular queries in the Boolean hierarchy -- Characterization of the principal type of normal forms in an intersection type system -- Correcting type errors in the Curry System -- Immediate fixpoints and their use in groundness analysis -- Graph types for monadic mobile processes.…”
Click to view e-book

Obsah: “…Improved bounds for on-line load balancing -- O(n log n)-average-time algorithm for shortest network under a given topology -- Steiner problems on directed acyclic graphs -- Wormhole versus deflection routing: A case study on the mesh -- On sparse parity check matrices (extended abstract) -- Finding a hidden code by asking questions -- Improved length lower bounds for reflecting sequences -- Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders -- Output-sensitive reporting of disjoint paths (extended abstract) -- Rectangular grid drawings of plane graphs -- Area-efficient algorithms for upward straight-line tree drawings -- Straight skeletons for general polygonal figures in the plane -- A note on uniform circuit lower bounds for the counting hierarchy (extended abstract) -- A note on the simulation of exponential threshold weights -- Harmonic analysis, real approximation, and the communication complexity of Boolean functions -- Finding large planar subgraphs and large subgraphs of a given genus -- Efficient deterministic algorithms for embedding graphs on books -- Optimal bi-level augmentation for selective! …”
Click to view e-book

Obsah: “…1 Introduction to Learning Systems -- 1.1 Systems, Memory -- 1.2 Performance Index -- 1.3 Learning Algorithms -- 1.4 Some Examples of Learning Systems -- References -- 2 Deterministic Algorithms -- 2.1 Simple Projection Algorithms in Spaces With Different Norms (Structure, Convergence, Properties) -- 2.2 Modified Projection Algorithms With a High Rate of Convergence -- References -- 3 Deterministic and Stochastic Algorithms of Optimisation -- 3.1 Deterministic Methods for Unconstrained Minimisation -- 3.2 Stochastic Approximation and Recurrent Estimation -- References -- 4 Stochastic Algorithms: The Least Squares Method in the Non-Recurrent and Recurrent Forms and the Gauss-Markov Theorem -- 4.1 The Least Squares Method in Recursive and Non-Recursive Forms (The White Noise Case) -- 4.2 The Gauss-Markov Theorem -- 4.3 Example System -- References -- 5 Stochastic Algorithms -- 5.1 Algorithms With Forgetting Factor -- 5.2 The Least Squares Method by Correlated Noise in the Non-Recursive and Recursive Forms: Connection With Decorrelation Procedures -- 5.3 Introduction to the Kaiman filter [1], [3] -- References -- 6 Multilayer Neural Networks -- 6.1 Multilayer Neural Network as a Non-Linear Transformer. …”
Click to view e-book

Obsah: “…Plenary Talks -- Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks -- Constraints, Graphs, Algebra, Logic, and Complexity -- Distributed Systems and Their Environments -- Invited Special Session: Models of Computation -- Co-evolution and Information Signals in Biological Sequences -- The Extended Turing Model as Contextual Tool -- Strong Positive Reducibilities -- Invited Special Session: Algorithms and Complexity -- Fixed-Parameter Algorithms for Graph-Modeled Date Clustering -- On Spanners of Geometric Graphs -- Searching Trees: An Essay -- Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems -- Contributed Papers -- A Quadratic Kernel for 3-Set Packing -- Quantitative Aspects of Speed-Up and Gap Phenomena -- Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG -- On the Connection between Interval Size Functions and Path Counting -- On the Red/Blue Spanning Tree Problem -- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata -- A Computational Proof of Complexity of Some Restricted Counting Problems -- Block-Graph Width -- Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs -- On Parameterized Exponential Time Complexity -- Best-Order Streaming Model -- Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces -- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data -- Improved Deterministic Algorithms for Weighted Matching and Packing Problems -- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover -- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability -- A Complete Characterisation of the Linear Clique-Width of Path Powers -- Preserving Privacy versus Data Retention -- Kolmogorov Complexity and Combinatorial Methods in Communication Complexity -- An Almost Totally Universal Tile Set -- Linear Kernel for Planar Connected Dominating Set -- A Simple Greedy Algorithm for the k-Disjoint Flow Problem -- Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions -- Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code -- Terminal Coalgebras for Measure-Polynomial Functors -- High Minimal Pairs in the Enumeration Degrees -- Searching a Circular Corridor with Two Flashlights -- On the Complexity of the Multiple Stack TSP, kSTSP -- Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments -- An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues -- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem -- On the Tractability of Maximal Strip Recovery -- Greedy Local Search and Vertex Cover in Sparse Random Graphs -- Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms -- Feasibility of Motion Planning on Directed Graphs -- Polynomial-Time Algorithm for Sorting by Generalized Translocations -- The Two-Guard Polygon Walk Problem -- Approximation and Hardness Results for Label Cut and Related Problems -- An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge.…”
Click to view e-book

Obsah: “…-- Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods -- Session 2B -- On the Decidability of Temporal Properties of Probabilistic Pushdown Automata -- Deciding Properties of Contract-Signing Protocols -- Session 3A -- Polylog-Time Reductions Decrease Dot-Depth -- On the Computational Complexity of the Forcing Chromatic Number -- More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP -- Session 3B -- Three Optimal Algorithms for Balls of Three Colors -- Cost Sharing and Strategyproof Mechanisms for Set Cover Games -- On Weighted Balls-into-Bins Games -- Session 4A -- Computing Minimal Multi-homogeneous Bézout Numbers Is Hard -- Dynamic Complexity Theory Revisited -- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size -- Session 4B -- Shortest Monotone Descent Path Problem in Polyhedral Terrain -- Packet Buffering: Randomization Beats Deterministic Algorithms -- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time -- Session 5A -- Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms -- Regular Tree Languages Definable in FO -- Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations -- Session 5B -- Connectivity for Wireless Agents Moving on a Cycle or Grid -- Improved Algorithms for Dynamic Page Migration -- Approximate Range Mode and Range Median Queries -- Session 6A -- Topological Automata -- Minimizing NFA’s and Regular Expressions -- Session 6B -- Increasing Kolmogorov Complexity -- Kolmogorov-Loveland Randomness and Stochasticity -- Session 7A -- Information Theory in Property Testing and Monotonicity Testing in Higher Dimension -- On Nash Equilibria in Non-cooperative All-Optical Networks -- Speed Scaling to Manage Temperature -- Session 7B -- The Complexity of Solving Linear Equations over a Finite Ring -- A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields -- Characterizing TC0 in Terms of Infinite Groups -- Session 8A -- Fast Pruning of Geometric Spanners -- The PIGs Full Monty – A Floor Show of Minimal Separators -- Centrality Measures Based on Current Flow -- Session 8B -- Varieties of Codes and Kraft Inequality -- Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes -- The Power of Commuting with Finite Sets of Words -- Session 9A -- Exact Quantum Algorithms for the Leader Election Problem -- Robust Polynomials and Quantum Algorithms -- Quantum Interactive Proofs with Competing Provers -- Session 9B -- Roundings Respecting Hard Constraints -- Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves -- Cycle Cover with Short Cycles -- Session 10A -- A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs -- All-Pairs Nearly 2-Approximate Shortest-Paths in O(n 2 polylog n) Time -- Session 10B -- Pattern Occurrences in Multicomponent Models -- Automatic Presentations for Finitely Generated Groups.…”
Click to view e-book

Obsah: “…Solving LP Relaxations of Large-Scale Precedence Constrained Problems -- Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings -- Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems -- Restricted b-Matchings in Degree-Bounded Graphs -- Zero-Coefficient Cuts -- Prize-Collecting Steiner Network Problems -- On Lifting Integer Variables in Minimal Inequalities -- Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities -- On Generalizations of Network Design Problems with Degree Bounds -- A Polyhedral Study of the Mixed Integer Cut -- Symmetry Matters for the Sizes of Extended Formulations -- A 3-Approximation for Facility Location with Uniform Capacities -- Secretary Problems via Linear Programming -- Branched Polyhedral Systems -- Hitting Diamonds and Growing Cacti -- Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems -- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs -- Universal Sequencing on a Single Machine -- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm -- Integer Quadratic Quasi-polyhedra -- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs -- An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming -- Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain -- The Price of Collusion in Series-Parallel Networks -- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron -- A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information -- On Column-Restricted and Priority Covering Integer Programs -- On k-Column Sparse Packing Programs -- Hypergraphic LP Relaxations for Steiner Trees -- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs -- Efficient Algorithms for Average Completion Time Scheduling -- Experiments with Two Row Tableau Cuts -- An OPT?…”
Click to view e-book

Obsah: “…-Generalized Sweeping Line Spanners -- Rooting Gene Trees via Phylogenetic Networks -- An evolving network model from clique extension -- Online semi-matching problem with two heterogeneous sensors in a metric space -- Two-Stage BP Maximization under p-matroid Constraint -- The Hamiltonian Path Graph is Connected for Simple s,t Paths in Rectangular Grid Graphs -- An O(n3)-Time Algorithm for the Min-Gap -- Unit-Length Job Scheduling Problem -- Approximation Schemes for k-Facility Location -- Improved Deterministic Algorithms for Non-monotone Submodular Maximization -- Distributed Dominating Sets in Interval Graphs -- Optimal Window Queries on Line Segments using the Trapezoidal Search DAG -- On Rotation Distance, Transpositions and Rank Bounded Trees -- Hitting Geometric Objects Online via Points in Zd -- Capacitated Facility Location with Outliers/Penalties Improved Separated Red Blue Center Clustering -- Proper colorability of segment intersection graphs.…”
Click for online access

Obsah: “…Adjacency Labelling of Planar Graphs (and Beyond) -- Algorithms for Explainable Clustering -- On the Spanning and Routing Ratios of the Directed 6-Graph -- The Minimum Moving Spanning Tree Problem -- Scheduling with Testing on Multiple Identical Parallel Machines -- Online Makespan Minimization With Budgeted Uncertainty -- Pattern Matching in Doubling Spaces -- Reachability Problems for Transmission Graphs -- On Minimum Generalized Manhattan Connections -- HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields -- Generalized Disk Graphs -- A 4-Approximation of the 2[pi]/3 -MST -- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations -- The Neighborhood Polynomial of Chordal -- Incomplete Directed Perfect Phylogeny in Linear Time -- Euclidean maximum matchings in the plane--local to global -- Solving Problems on Generalized Convex Graphs via Mim-Width -- Improved Bounds on the Spanning Ratio of the Theta-5 Graph -- Computing Weighted Subset Transversals in H-Free Graphs -- Computing the Fréchet Distance Between Uncertain Curves in One Dimension -- Finding a Largest-Area Triangle in a Terrain in Near-Linear Time -- Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees -- An APTAS for Bin Packing with Clique-graph Conflicts -- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs -- ANN for time series under the Fréchet distance -- Strictly In-Place Algorithms for Permuting and Inverting -- A Stronger Lower Bound on Parametric Minimum Spanning Trees -- Online bin packing of squares and cubes -- Exploration of k-Edge-Deficient Temporal Graphs -- Parameterized Complexity of Categorical Clustering with Size Constraints -- Graph Pricing With Limited Supply -- Fair Correlation Clustering with Global and Local Guarantees -- Better Distance Labeling for Unweighted Planar Graphs -- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths -- Algorithms for Radius-Optimally Augmenting Trees in a Metric Space -- Upper and Lower Bounds for Fully Retroactive Graph Problem -- Characterization of Super-stable Matching -- Uniform Embeddings for Robinson Similarity Matrices -- Particle-Based Assembly Using Precise Global Control Independent Sets in Semi-random Hypergraphs -- A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs -- Support Optimality and Adaptive Cuckoo Filters -- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time -- Algorithms for the Line-Constrained Disk Coverage and Related Problems -- A universal cycle for strings with fixed-content (which are also known as multiset permutations) -- Routing on Heavy-Path WSPD-Spanners -- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance -- Diverse Partitions of Colored Points -- Reverse Shortest Path Problem for Unit-Disk Graphs.…”
Click for online access

Obsah: “…9.3 The optimization objectives -- 9.4 The optimization algorithms -- 9.4.1 The deterministic algorithms -- 9.4.2 The stochastic algorithms -- 9.5 The direct aperture optimization -- 9.6 The biological optimization -- 9.6.1 The radiobiological models for TCP, NTCP, EUD -- 9.7 Benefit and deficiencies in biological optimization -- 9.8 Robust optimization -- References -- Chapter 10 Dose calculation -- 10.1 Required accuracy in dose calculation -- 10.2 Dose calculation algorithms and classification -- 10.2.1 The empirical models -- 10.2.2 The semi-empirical, correction-based algorithms…”
Click for online access

Obsah: “…A fast evolutionary-deterministic algorithm to study multimodal current fields under safety level constraintsModelling of magnetic anisotropy in the finite element method; Reconstruction of crack profile using fuzzy logic; Synthesis of boundary conditions in a subdomain using the numerical Schwarz-Christoffel transformation for the field analysis; Computation of general nonstationary 2D eddy currents in linear moving arrangements using integrodifferential approach; Three-dimensional finite element modeling of inductive and capacitive effects in micro-coils.…”
Click for online access

Obsah: “…A New Pattern Recognition Puzzle -- Poster Session -- Edit Distance Computed by Fast Bipartite Graph Matching -- Statistical Method for Semantic Segmentation of Dominant Plane from Remote Exploration Image Sequence -- Analyses on Generalization Error of Ensemble Kernel Regressors -- Structural Human Shape Analysis for Modeling and Recognition -- On Cross-Validation for MLP Model Evaluation -- Weighted Mean Assignment of a Pair of Correspondences Using Optimisation Functions -- Chemical Symbol Feature Set for Handwritten Chemical Symbol Recognition -- About Combining Metric Learning and Prototype Generation -- Tracking System with Re-identification Using a RGB String Kernel -- Towards Scalable Prototype Selection by Genetic Algorithms with Fast Criteria -- IOWA Operators and Its Application to Image Retrieval -- On Optimum Thresholding of Multivariate Change Detectors -- Commute Time for a Gaussian Wave Packet on a Graph -- Properties of Object-Level Cross-Validation Schemes for Symmetric Pair-Input Data -- A Binary Factor Graph Model for Biclustering -- Improved BLSTM Neural Networks for Recognition of On-Line Bangla Complex Words -- A Ranking Part Model for Object Detection -- Regular Decomposition of Multivariate Time Series and Other Matrices -- Texture Synthesis: From Convolutional RBMs to Efficient Deterministic Algorithms -- Improved Object Matching Using Structural Relations -- Designing LDPC Codes for ECOC Classification Systems -- Unifying Probabilistic Linear Discriminant Analysis Variants in Biometric Authentication.…”
Click to view e-book

Obsah: “…-Increasing Diamonds -- Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs -- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-Vertex Cover in Bipartite Graphs -- Improved Spanning Ratio for Low Degree Spanners -- Constructing Consistent Digital Line Segments -- Faster Information Gathering in Ad-Hoc Radio Tree Networks -- Stabbing circles for Sets of Segments in the Plane -- Faster Algorithms to Enumerate Hypergraph Transversals -- Listing Acyclic Orientations of Graphs with Single and Multiple Sources -- Linear-Time Sequence Comparison Using Minimal Absent Words -- The Grandmama de Bruijn Sequence for Binary Strings -- Compressing Bounded Degree Graphs -- Random Partial Match Queries in Quad-K-d Trees -- From Discrepancy to Majority -- On the Planar Split Thickness of Graphs -- A Bounded-Risk Mechanism for the Kidney Exchange Game -- Tight Approximations of Degeneracy in Large Graphs -- Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center -- Bundled Crossings in Embedded Graphs -- Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering -- Deterministic Sparse Suffix Sorting on Rewritable Texts -- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Ordering -- Unshuffling Permutations -- Generating Random Spanning Trees via Fast Matrix Multiplication -- Routing in Unit Disk Graphs -- Graph Drawings with One Bend and Few Slopes -- Edge-Editing to a Dense and a Sparse Graph Class -- Containment and Evasion in Stochastic Point Data -- Tree Compression Using String Grammars -- Trees and Languages with Periodic Signature -- Rank Reduction of Directed Graphs by Vertex and Edge Deletions -- New Deterministic Algorithms for Solving Parity Games -- Computing a Geodesic Two-Center of Points in a Simple Polygon -- Simple Approximation Algorithms for Balanced MAX 2SAT -- A Parameterized Algorithm for Mixed-Cut -- (k; n - k)-MAX-CUT: An O*(2p)-Time Algorithm and a Polynomial Kernel -- Independent set of convex polygons: from nƐ to 1 + Ɛ via shrinking.…”
Click to view e-book

Obsah: “…On scale and resolution in the analysis of local image structure -- Optimal filter for edge detection methods and results -- Biased anisotropic diffusion—A unified regularization and diffusion approach to edge detection -- Hierarchical image analysis using irregular tessellations -- A bit plane architecture for an image analysis processor implemented with P.L.C.A. gate array -- Scale-space singularities -- Recursive filtering and edge closing: Two primary tools for 3D edge detection -- Edge contours using multiple scales -- Stereo integration, mean field theory and psychophysics -- A pyramidal stereovision algorithm based on contour chain points -- Parallel and deterministic algorithms from MRFs: Surface reconstruction and integration -- Parallel multiscale stereo matching using adaptive smoothing -- On the motion of 3D curves and its relationship to optical flow -- Structure-from-motion under orthographic projection -- Parallel computation of optic flow -- Obstacle detection by evaluation of optical flow fields from image sequences -- Extending the ‘Oriented smoothness constraint’ into the temporal domain and the estimation of derivatives of optical flow -- A comparison of stochastic and deterministic solution methods in Bayesian estimation of 2-D motion -- Motion determination in space-time images -- Ambiguity in reconstruction from image correspondences -- An optimal solution for mobile camera calibration -- Analytical results on error sensitivity of motion estimation from two views -- On the estimation of depth from motion using an anthropomrphic visual sensor -- The derivation of qualitative information in motion analysis -- Road following algorithm using a panned plan-view transformation -- 3D-vision-based robot navigation: First steps -- Dynamic world modeling using vertical line stereo -- Tracking in a complex visual environment -- Tracking line segments -- Measurement and integration of 3-D structures by tracking edge lines -- Estimation of 3D-motion and structure from tracking 2D-lines in a sequence of images -- The incremental rigidity scheme for structure from motion: The line-based formulation -- Object detection using model based prediction and motion parallax -- Detection and tracking of moving objects based on a statistical regularization method in space and time -- Vertical and horizontal disparities from phase -- Stereo correspondence from optic flow -- A model for the estimate of local velocity -- Direct evidence for occlusion in stereo and motion -- On the use of trajectory information to assist stereopsis in a dynamic environment -- Distributed learning of texture classification -- Fast shape from shading -- Inverse perspective of a triangle: New exact and approximate solutions -- Finding geometric and relational structures in an image -- Recovery of volumetric object descriptions from laser rangefinder images -- Extraction of deformable part models -- Toward a computational theory of shape: An overview -- Stabilized solution for 3-D model parameters -- Deformable templates for feature extraction from medical images -- Charting surface structure -- Projectively invariant representations using implicit algebraic curves -- Shape from contour using symmetries -- Using occluding contours for 3D object modeling -- Robust estimation of surface curvature from deformation of apparent contours -- Spatial localization of modelled objects of revolution in monocular perspective vision -- On the verification of hypothesized matches in model-based recognition -- Object recognition using local geometric constraints: A robust alternative to tree-search -- Simd geometric matching -- A 3D interpretation system based on consistent labeling of a set of propositions. …”
Click to view e-book

Obsah: “…Invited Talk -- Game Semantics: Achievements and Prospects -- Clique Is Hard to Approximate within n 1-o(1) -- Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time -- Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming -- A Statically Allocated Parallel Functional Language -- An Optimal Minimum Spanning Tree Algorithm -- Improved Shortest Paths on the Word RAM -- Improved Algorithms for Finding Level Ancestors in Dynamic Trees -- Lax Logical Relations -- Reasoning about Idealized ALGOL Using Regular Languages -- The Measurement Process in Domain Theory -- Invited Talk -- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution -- Monotone Proofs of the Pigeon Hole Principle -- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models -- Algebraic Models for Contextual Nets -- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems -- Measures of Nondeterminism in Finite Automata -- LTL Is Expressively Complete for Mazurkiewicz Traces -- An Automata-Theoretic Completeness Proof for Interval Temporal Logic -- Invited Talk -- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? -- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search -- Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices -- Variable Independence, Quantifier Elimination, and Constraint Representations -- Constraint Satisfaction Problems and Finite Algebras -- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing -- Resource Augmentation for Online Bounded Space Bin Packing -- Optimal Projective Algorithms for the List Update Problem -- Efficient Verification Algorithms for One-Counter Processes -- On the Complexity of Bisimulation Problems for Basic Parallel Processes -- Decidable First-Order Transition Logics for PA-Processes -- Invited Talk -- Non Interference for the Analysis of Cryptographic Protocols -- Average Bit-Complexity of Euclidean Algorithms -- Planar Maps and Airy Phenomena -- Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System -- Information Flow vs. …”
Click to view e-book

Obsah: “…Plenary Sessions -- Looking for Awareness in the Brain -- Pattern Classification: Fusion of Information -- Database Retrieval Oriented Approach for Model-Based Object Recognition -- Image Processing -- Combined Feature Sets for Texture Classification -- Using CBR Learning for the Low-Level and High-Level Unit of an Image Interpretation System -- Application of the Trace Transform to Change Detection -- Using Natural Language and Video Data to Query and Learn American Football Plays -- Invariant Content-Based Image Retrieval using the Fourier-Mellin Transform -- Performance Assessment of Edge-Based Range Image Segmentation -- Image Variability Decomposition for Recovering Pose and Illumination from Object Tracking -- On Increasing the Objectiveness of Segmentation Results -- Color-Based Moment Invariants for Viewpoint and Illumination Independent Recognition of Planar Color Patterns -- Medical Analysis -- Error and Shape Measurement Tools for Cardiac Projection Images: A Closer Look -- Recent Advances Towards a Model-Based Pattern-Recognition Approach for the Left Ventricle Boundary Estimation -- An Approach to Dynamic Modelling and Topographic Feature Extraction of Wake EEG -- Algorithms for Fuzzy Segmentation -- Neural and Evolutionary Computing -- Unsupervised Learning without Overfitting: Empirical Risk Approximation as an Induction Principle for Reliable Clustering -- Application of Neural Networks to Vehicle Recognition and Tracking -- An Artificial Neural Network Based Encoding of an Invariant Sammon Map for Real-Time Projection of Patterns from Odour Sensor Arrays -- Probabalistic and Other Neural Nets in Multi-Hole Probe Calibration and Flow Angularity Pattern Recognition -- Beyond PaRADISE: Extensions to a Neural Network for Visual Object Recognition -- Parallel Decomposition of Generic Morphological Structuring Elements -- Neural Learning of Spiral Structures -- Ranking Pattern Recognition Features for Neural Networks -- Speech Recognition -- A Hybrid Approach to Pattern Matching for Text-To-Speech Conversion -- Robust Speech Recognition using Fuzzy Matrix/Vector Quantisation, Neural Networks and Hidden Markov Models -- An Experimental Study on Confidence Measures for Robust Speech Recognition -- Refinement of a Structured Language Model -- Document and Character Analysis -- An Adaptative Pre-Processing for On-Line Hand-Written Character Recognition by Blind People -- Categorizing Document Images into Script and Language Classes -- Table Recognition and Labeling using Intrinsic Layout Features -- Recognition of Printed Arabic Text via Machine Learning -- A Deterministic Algorithm for Reconstructing Off-Line Calligraphical Strokes with Priority Rules -- Off-Line Handwritten Chinese Character Recognition Based on Structural Features and Fuzzy ARTMAP -- Agent-Based Text Extraction from Pyramid Images -- Pattern Recognition -- Vector Quantization and Minimum Description Length -- Localized Soft Subspace Pattern Classification -- A Quantum Leap to Advances in Pattern Recognition -- A Comparative Study of String Dissimilarity Measures in Structural Clustering -- Support Vector Machines and Linear Spectral Unmixing for Remote Sensing -- Why Classical Models for Pattern Recognition are not Pattern Recognition Models -- Pattern Discovery in Time-Oriented Data -- Adaptive Graphical Pattern Recognition: The Joint Role of Structure and Learning -- Tutorials -- Classification using Networks of Normalized Radial Basis Function -- Pattern Recognition - A Pillar in the Sensor Fusion Edifice or Vice-Versa? …”
Click to view e-book

Obsah: “…2 Preliminaries -- 3 The l1-Relaxation for Random Targets b -- 4 Proximity Between Optimal Solutions of ([P0]P0) and ([P1]P1) -- 5 A Deterministic Algorithm -- 6 Extension -- References -- Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty -- 1 Introduction -- 2 Recycling Valid Inequalities -- 3 Facet-Defining Recycled Inequalities -- 4 Computational Study -- 4.1 Robust Independent Set -- 4.2 Robust Bipartite Matching -- 5 Conclusion -- References -- Inapproximability of Shortest Paths on Perfect Matching Polytopes -- 1 Introduction -- 1.1 Our Result…”
Click for online access

Obsah: “…Uncovering the State of an Individual: A Continuous Markov Procedure -- A Deterministic Algorithm -- Outline of a Markovian Stochastic Process -- Notation and Basic Concepts -- Special Cases -- General Results -- Uncovering the Latent State -- Refining the Assessment -- Proofs* -- Original Sources and Related Works -- Problems -- 11. …”
Click to view e-book

Obsah: “…Mixing and Information Dissemination on Cayley Graphs -- Light Orthogonal Networks with Constant Geometric Dilation -- Session 3B -- Admissibility in Infinite Games -- Pure Stationary Optimal Strategies in Markov Decision Processes -- Symmetries and the Complexity of Pure Nash Equilibrium -- Session 4A -- Computing Representations of Matroids of Bounded Branch-Width -- Characterizing Minimal Interval Completions -- Session 4B -- The Complexity of Unions of Disjoint Sets -- Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity -- Session 5A -- Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets -- On the Complexity of Affine Image Matching -- Session 5B -- On Fixed Point Equations over Commutative Semirings -- An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings -- Session 6A -- A Cubic Kernel for Feedback Vertex Set -- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting -- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs -- Session 6B -- A Search Algorithm for the Maximal Attractor of a Cellular Automaton -- Universal Tilings -- On the Complexity of Unary Tiling-Recognizable Picture Languages -- Session 7A -- A Characterization of Strong Learnability in the Statistical Query Model -- On the Consistency of Discrete Bayesian Learning -- Session 7B -- VPSPACE and a Transfer Theorem over the Reals -- On Symmetric Signatures in Holographic Algorithms -- Session 8A -- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations -- Cheating to Get Better Roommates in a Random Stable Matching -- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window -- Session 8B -- Arithmetizing Classes Around NC 1 and L -- The Polynomially Bounded Perfect Matching Problem Is in NC 2 -- Languages with Bounded Multiparty Communication Complexity -- Session 9A -- New Approximation Algorithms for Minimum Cycle Bases of Graphs -- On Completing Latin Squares -- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications -- Session 9B -- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic -- Bounded-Variable Fragments of Hybrid Logics -- Rank-1 Modal Logics Are Coalgebraic -- Session 10A -- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups -- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem -- Quantum Network Coding -- Session 10B -- Reachability in Unions of Commutative Rewriting Systems Is Decidable -- Associative-Commutative Deducibility Constraints -- On the Automatic Analysis of Recursive Security Protocols with XOR -- Session 11A -- Improved Online Algorithms for the Sorting Buffer Problem -- Cost Sharing Methods for Makespan and Completion Time Scheduling -- Session 11B -- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests -- Enumerating All Solutions for Constraint Satisfaction Problems.…”
Click to view e-book

Obsah: “…Profile of Tries -- Random 2-XORSAT at the Satisfiability Threshold -- On Dissemination Thresholds in Regular and Irregular Graph Classes -- How to Complete a Doubling Metric -- Sorting and Selection with Random Costs -- Guided Search and a Faster Deterministic Algorithm for 3-SAT -- Comparing and Aggregating Partially Resolved Trees -- Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices -- On Stateless Multihead Automata: Hierarchies and the Emptiness Problem -- Myhill-Nerode Theorem for Recognizable Tree Series Revisited -- The View Selection Problem for Regular Path Queries -- Optimal Higher Order Delaunay Triangulations of Polygons -- Coloring Geometric Range Spaces -- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes -- Spanners of Complete k-Partite Geometric Graphs -- Minimum Cost Homomorphisms to Reflexive Digraphs -- On the Complexity of Reconstructing H-free Graphs from Their Star Systems -- Optimization and Recognition for K 5-minor Free Graphs in Linear Time -- Bandwidth of Bipartite Permutation Graphs in Polynomial Time -- The Online Transportation Problem: On the Exponential Boost of One Extra Server -- Average Rate Speed Scaling -- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers -- Maximizing the Minimum Load for Selfish Agents -- Approximate Polynomial gcd: Small Degree and Small Height Perturbations -- Pseudorandom Graphs from Elliptic Curves -- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) -- Sparse Approximate Solutions to Semidefinite Programs -- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints -- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant -- Competitive Cost Sharing with Economies of Scale -- Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes -- Fully-Compressed Suffix Trees -- Improved Dynamic Rank-Select Entropy-Bound Structures -- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees -- List Update with Locality of Reference -- Approximating Steiner Networks with Node Weights -- Approximating Minimum-Power Degree and Connectivity Problems -- Energy Efficient Monitoring in Sensor Networks -- Approximation Algorithms for k-Hurdle Problems -- Approximating Crossing Minimization in Radial Layouts -- New Upper Bound on Vertex Folkman Numbers -- Ptolemaic Graphs and Interval Graphs Are Leaf Powers -- A Representation Theorem for Union-Difference Families and Application -- Algorithms to Locate Errors Using Covering Arrays -- On Injective Colourings of Chordal Graphs -- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms -- On 2-Subcolourings of Chordal Graphs -- Collective Additive Tree Spanners of Homogeneously Orderable Graphs -- The Generalized Median Stable Matchings: Finding Them Is Not That Easy -- Stateless Near Optimal Flow Control with Poly-logarithmic Convergence -- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences -- Randomized Rendez-Vous with Limited Memory -- Origami Embedding of Piecewise-Linear Two-Manifolds -- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance -- Weighted Rectilinear Approximation of Points in the Plane -- Paths with no Small Angles -- Simpler Constant-Seed Condensers -- Parallel Repetition of the Odd Cycle Game -- I/O-Efficient Point Location in a Set of Rectangles -- Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream -- Fixed-Parameter Algorithms for Cluster Vertex Deletion -- Paths and Trails in Edge-Colored Graphs -- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs -- Domination in Geometric Intersection Graphs -- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups -- Quantum Property Testing of Group Solvability -- Solving NP-Complete Problems with Quantum Search.…”
Click to view e-book

Obsah: “…1 -- On Counting Homomorphisms to Directed Acyclic Graphs -- Quantum Computing -- Fault-Tolerance Threshold for a Distance-Three Quantum Code -- Lower Bounds on Matrix Rigidity Via a Quantum Argument -- Self-testing of Quantum Circuits -- Deterministic Extractors for Independent-Symbol Sources -- Randomness -- Gap Amplification in PCPs Using Lazy Random Walks -- Stopping Times, Metrics and Approximate Counting -- Formal Languages -- Algebraic Characterization of the Finite Power Property -- P-completeness of Cellular Automaton Rule 110 -- Small Sweeping 2NFAs Are Not Closed Under Complement -- Expressive Power of Pebble Automata -- Approximation Algorithms I -- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs -- Better Algorithms for Minimizing Average Flow-Time on Related Machines -- A Push-Relabel Algorithm for Approximating Degree Bounded MSTs -- Edge Disjoint Paths in Moderately Connected Graphs -- Approximation Algorithms II -- A Robust APTAS for the Classical Bin Packing Problem -- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion -- Approximating the Orthogonal Knapsack Problem for Hypercubes -- Graph Algorithms I -- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs -- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems -- Weighted Bipartite Matching in Matrix Multiplication Time -- Algorithms I -- Optimal Resilient Sorting and Searching in the Presence of Memory Faults -- Reliable and Efficient Computational Geometry Via Controlled Perturbation -- Tight Bounds for Selfish and Greedy Load Balancing -- Complexity I -- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies -- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws -- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies -- Data Structures and Linear Algebra -- Suffix Trays and Suffix Trists: Structures for Faster Text Indexing -- Optimal Lower Bounds for Rank and Select Indexes -- Dynamic Interpolation Search Revisited -- Dynamic Matrix Rank -- Graphs -- Nearly Optimal Visibility Representations of Plane Graphs -- Planar Crossing Numbers of Genus g Graphs -- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover -- Tight Approximation Algorithm for Connectivity Augmentation Problems -- Complexity II -- On the Bipartite Unique Perfect Matching Problem -- Comparing Reductions to NP-Complete Sets -- Design Is as Easy as Optimization -- On the Complexity of 2D Discrete Fixed Point Problem -- Game Theory I -- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions -- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games -- Network Games with Atomic Players -- Algorithms II -- Finite-State Dimension and Real Arithmetic -- Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings -- The Myriad Virtues of Wavelet Trees -- Game Theory II -- Atomic Congestion Games Among Coalitions -- Computing Equilibrium Prices in Exchange Economies with Tax Distortions -- New Constructions of Mechanisms with Verification -- Networks, Circuits and Regular Expressions -- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations -- Dynamic Routing Schemes for General Graphs -- Energy Complexity and Entropy of Threshold Circuits -- New Algorithms for Regular Expression Matching -- Fixed Parameter Complexity and Approximation Algorithms -- A Parameterized View on Matroid Optimization Problems -- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction -- Length-Bounded Cuts and Flows -- Graph Algorithms II -- An Adaptive Spectral Heuristic for Partitioning Random Graphs -- Some Results on Matchgates and Holographic Algorithms -- Weighted Popular Matchings.…”
Click to view e-book

Obsah: “…-- A Faster Lattice Reduction Method Using Quantum Search -- 3B Graph and Combinatorial Algorithms III -- Three Sorting Algorithms Using Priority Queues -- Lower Bounds on Correction Networks -- Approximate Regular Expression Searching with Arbitrary Integer Weights -- Constructing Compressed Suffix Arrays with Large Alphabets -- 4A Computational Geometry II -- On the Geometric Dilation of Finite Point Sets -- On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts -- Optimal Point Set Projections onto Regular Grids -- 4B Combinatorial Optimization I -- An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas -- A Faster Algorithm for Two-Variable Integer Programming -- Efficient Algorithms for Generation of Combinatorial Covering Suites -- 5A Scheduling -- A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags -- On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates -- Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes -- 5B Computational Biology -- Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome -- Settling the Intractability of Multiple Alignment -- Efficient Algorithms for Optimizing Whole Genome Alignment with Noise -- 6A Computational Geometry III -- Segmenting Doughnut-Shaped Objects in Medical Images -- On the Locality Properties of Space-Filling Curves -- Geometric Restrictions on Producible Polygonal Protein Chains -- Symmetric Layout of Disconnected Graphs -- 6B Graph and Combinatorial Algorithms IV -- Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching -- Enumerating Global Roundings of an Outerplanar Graph -- Augmenting Forests to Meet Odd Diameter Requirements -- On the Existence and Determination of Satisfactory Partitions in a Graph -- 7A Distributed and Parallel Algorithms -- A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model -- An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees -- 7B Graph and Combinatorial Algorithms V -- The Student-Project Allocation Problem -- Algorithms for Enumerating Circuits in Matroids -- A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model -- 8A Data Structure -- Succinct Data Structures for Searchable Partial Sums -- Range Mode and Range Median Queries on Lists and Trees -- Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests -- New Ways to Construct Binary Search Trees -- 8B Graph and Combinatorial Algorithms VI -- Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth -- Biconnectivity on Symbolically Represented Graphs: A Linear Solution -- A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs -- Deterministic Algorithm for the t-Threshold Set Problem -- 9A Combinatorial and Network Optimization -- Energy-Efficient Wireless Network Design -- Wavelength Conversion in Shortest-Path All-Optical Networks -- A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact -- Flexible Train Rostering -- 9B Computational Complexity and Cryptography -- Counting Complexity Classes over the Reals I: The Additive Case -- Some Properties of One-Pebble Turing Machines with Sublogarithmic Space -- Hypergraph Decomposition and Secret Sharing -- A Promising Key Agreement Protocol -- 10A Game Theory and Randomized Algorithm -- Rapid Mixing of Several Markov Chains for a Hard-Core Model -- Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution -- Fair Cost Allocations under Conflicts — A Game-Theoretic Point of View — -- Equilibria for Networks with Malicious Users -- 10B Algebraic and Arithmetic Computation -- Quasi-optimal Arithmetic for Quaternion Polynomials -- Upper Bounds on the Complexity of Some Galois Theory Problems -- Unfolded Modular Multiplication -- Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic.…”
Click to view e-book

Click to view e-book

Click for online access