Algorithms and Data Structures [[electronic resource] ] : 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro

• Record Nr.: UNISA996465671203316
• Pubbl/distr/stampa: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991
• ISBN: 3-540-47566-4
• Edizione: [1st ed. 1991.]
• Descrizione fisica: 1 online resource (X, 502 p.)
• Collana: Lecture Notes in Computer Science, , 0302-9743 ; ; 519
• Disciplina: 005.7/3
• Soggetti: Algorithms; Computers; Combinatorics; Probabilities; Statistics ; Information storage and retrieval; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Probability Theory and Stochastic Processes; Statistics, general; Information Storage and Retrieval
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: A case study in comparison based complexity: Finding the nearest value(s) -- On the zone of a surface in a hyperplane arrangement -- Ray-shooting and isotopy classes of lines in 3-dimensional space -- Finding level-ancestors in dynamic trees -- Treewidth of circular-arc graphs+ -- Fully dynamic delaunay triangulation in logarithmic expected time per operation -- On computing the voronoi diagram for restricted planar figures -- The MINSUMCUT problem -- Efficient algorithms for the minimum range cut problems -- Memory access in models of parallel computation: From folklore to synergy and beyond -- Farthest neighbors, maximum spanning trees and related problems in higher dimensions -- Shallow interdistance selection and ; interdistance enumeration -- Sharing memory in asynchronous message passing systems -- A linear-time scheme for version reconstruction -- The interval skip list: A data structure for finding all intervals that overlap a point -- Geometric knapsack problems -- A fast derandomization scheme and its applications -- Unstructured path problems and the making of semirings -- Neighborhood graphs and geometric embedding -- Finding optimal bipartitions of points and polygons -- Immobilizing a polytope -- What can we learn about suffix trees from independent tries? -- Competitive algorithms for the weighted list update problem -- An optimal algorithm for the rectilinear link center of a rectilinear polygon -- Geometric searching and link distance -- Representing and enumerating edge connectivity cuts in RNC -- Planar graph augmentation problems -- Parametric search and locating supply centers in trees -- On bends and lengths of rectilinear paths: A graph-theoretic approach -- Computing minimum length paths of a given homotopy class -- Approximation algorithms for selecting network centers -- Facility dispersion problems: Heuristics and special cases -- Optimum guard covers and m-watchmen routes for restricted polygons -- Applications of a new space partitioning technique -- Offline algorithms for dynamic minimum spanning tree problems -- An empirical analysis of algorithms for constructing a minimum spanning tree -- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible -- Dynamically maintaining the visibility graph -- An optimal algorithm for computing visibility in the plane -- Fully persistent data structures for disjoint set union problems -- Algorithms for generating all spanning trees of undirected, directed and weighted graphs -- Sorting multisets and vectors in-place -- Probabilistic leader election on rings of known size.
• Sommario/riassunto: This volume presents the proceedings of the Second Workshop on Algorithms and Data Structures (WADS '91), held at Carleton University in Ottawa. The workshop was organized by the School of Computer Science at Carleton University. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 were selected for presentation at the workshop. In addition, there were 5 invited presentations.

Algorithms and Data Structures [[electronic resource] ] : Third Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides

• Record Nr.: UNISA996465874003316
• Pubbl/distr/stampa: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993
• ISBN: 3-540-47918-X
• Edizione: [1st ed. 1993.]
• Descrizione fisica: 1 online resource (XII, 636 p.)
• Collana: Lecture Notes in Computer Science, , 0302-9743 ; ; 709
• Disciplina: 005.7/3
• Soggetti: Computers; Computer programming; Mathematical analysis; Analysis (Mathematics); Algorithms; Combinatorics; Theory of Computation; Programming Techniques; Analysis; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: Computing the all-pairs longest chains in the plane -- Towards a better understanding of pure packet routing -- Tolerating faults in meshes and other networks -- A generalization of binary search -- Groups and algebraic complexity -- Connected component and simple polygon intersection searching -- An optimal algorithm for finding the separation of simple polygons -- Balanced search trees made simple -- Probing a set of hyperplanes by lines and related problems -- A general lower bound on the I/O-complexity of comparison-based algorithms -- Point probe decision trees for geometric concept classes -- A dynamic separator algorithm -- Online load balancing of ; temporary tasks -- Connected domination and steiner set on asteroidal triple-free graphs -- The complexity of finding certain trees in tournaments -- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) -- Separating the power of EREW and CREW PRAMs with small communication width -- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs -- Parallel construction of quadtrees and quality triangulations -- Pattern matching for permutations -- Filling polyhedral molds -- Deferred-query—An efficient approach for problems on interval and circular-arc graphs -- On the complexity of graph embeddings -- Algorithms for polytope covering and approximation -- Global strategies for augmenting the efficiency of TSP heuristics -- Static and dynamic algorithms for k-point clustering problems -- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers -- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) -- The K-D heap: An efficient multi-dimensional priority queue -- A complete and efficient algorithm for the intersection of a general and a convex polyhedron -- Computing the smallest k-enclosing circle and related problems -- An index data structure for matrices, with applications to fast two-dimensional pattern matching -- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects -- Further results on generalized intersection searching problems: Counting, reporting, and dynamization -- Generalized approximate algorithms for point set congruence -- Approximating shortest superstrings with constraints -- Tree reconstruction from partial orders -- Improved parallel depth-first search in undirected planar graphs -- On approximating the longest path in a graph -- Designing multi-commodity flow trees -- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs -- On fat partitioning, fat covering and the union size of polygons -- A time-randomness tradeoff for selection in parallel -- Detecting race conditions in parallel programs that use one semaphore -- An algorithm for finding predecessors in integer sets -- The exhaustion of shared memory: Stochastic results -- Minimum weight euclidean matching and weighted relative neighborhood graphs -- Efficient approximate shortest-path queries among isothetic rectangular obstacles -- Counting and reporting red/blue segment intersections -- Repetitive hidden-surface-removal for polyhedral scenes -- On reconfigurability of VLSI linear arrays -- Reconstructing strings from substrings (Extended abstract) -- Combinatorial complexity of signed discs -- Fast algorithms for one-dimensionsal compaction with jog insertion -- An optimal algorithm for roundness determination on convex polygons -- Practical algorithms on partial k-trees with an application to domination-like problems -- Greedy algorithms for the on-line steiner tree and generalized steiner problems.
• Sommario/riassunto: The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three ; program committee members, many of whom called upon additional reviewers.

Artificial intelligence and natural language : 11th conference, AINL 2022, Saint Petersburg, Russia, April 14-15, 2022, revised selected papers / / edited by Valentin Malykh, Andrey Filchenkov

• Record Nr.: UNISA996508667403316
• Pubbl/distr/stampa: Cham, Switzerland : , : Springer, , [2022]; ©2022
• ISBN: 3-031-23372-7
• Edizione: [1st ed. 2022.]
• Descrizione fisica: 1 online resource (117 pages)
• Collana: Communications in Computer and Information Science, , 1865-0937 ; ; 1731
• Disciplina: 060
• Soggetti: Artificial intelligence
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Inferring image background from text description -- Topical Extractive Summarization -- The Semantic Shifts of the Topical Structure in the Corpus of Lentach News Posts -- Development of folklore motif classifie using limited data -- Morphological and Emotional Features of the Speech in Children with Typical Development, Autism Spectrum Disorders and Down Syndrome -- WikiMulti: a Corpus for Cross-Lingual Summarization -- Rethinking Crowd Sourcing for Semantic Similarity -- Interplay of Visual and Acoustic Cues of Irony Perception: a Case Study of Actor’s Speech -- Findings of Biomedical Russian to English Machine Translation Competition -- Translation of medical texts with ensembling and knowledge distillation.
• Sommario/riassunto: This book constitutes the refereed proceedings of the 11th Conference on Artificial Intelligence and Natural Language, AINL 2022, held in St. Petersburg, Russia, in April 2022. The 8 revised full papers and 1 short paper were carefully reviewed and selected from 20 submissions. The volume presents recent research in areas of of text mining, speech technologies, dialogue systems, information retrieval, machine ; learning, articial intelligence, and robotics. .