Author: Mark H. Overmars
Publisher: Springer Science & Business Media
ISBN: 9783540123309
Category : Computers
Languages : en
Pages : 194
Book Description
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures.
The Design of Dynamic Data Structures
Author: Mark H. Overmars
Publisher: Springer Science & Business Media
ISBN: 9783540123309
Category : Computers
Languages : en
Pages : 194
Book Description
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures.
Publisher: Springer Science & Business Media
ISBN: 9783540123309
Category : Computers
Languages : en
Pages : 194
Book Description
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures.
STACS 88
Author: Robert Cori
Publisher: Springer Science & Business Media
ISBN: 9783540188346
Category : Computers
Languages : en
Pages : 420
Book Description
This volume contains the presentations of the Fifth Symposium on Theoretical Aspects of Computer Science (STACS 88) held at the University of Bordeaux, February 11-13, 1988. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: algorithms, complexity, formal languages, rewriting systems and abstract data types, graph grammars, distributed algorithms, geometrical algorithms, trace languages, semantics of parallelism.
Publisher: Springer Science & Business Media
ISBN: 9783540188346
Category : Computers
Languages : en
Pages : 420
Book Description
This volume contains the presentations of the Fifth Symposium on Theoretical Aspects of Computer Science (STACS 88) held at the University of Bordeaux, February 11-13, 1988. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: algorithms, complexity, formal languages, rewriting systems and abstract data types, graph grammars, distributed algorithms, geometrical algorithms, trace languages, semantics of parallelism.
Advances in Information Technology Research and Application: 2011 Edition
Author:
Publisher: ScholarlyEditions
ISBN: 1464920745
Category : Computers
Languages : en
Pages : 1555
Book Description
Advances in Information Technology Research and Application: 2011 Edition is a ScholarlyEditions™ eBook that delivers timely, authoritative, and comprehensive information about Information Technology. The editors have built Advances in Information Technology Research and Application: 2011 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Information Technology in this eBook to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Advances in Information Technology Research and Application: 2011 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.
Publisher: ScholarlyEditions
ISBN: 1464920745
Category : Computers
Languages : en
Pages : 1555
Book Description
Advances in Information Technology Research and Application: 2011 Edition is a ScholarlyEditions™ eBook that delivers timely, authoritative, and comprehensive information about Information Technology. The editors have built Advances in Information Technology Research and Application: 2011 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Information Technology in this eBook to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Advances in Information Technology Research and Application: 2011 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.
Algorithms and Computation
Author: Toshihide Ibaraki
Publisher: Springer Science & Business Media
ISBN: 3540206957
Category : Computers
Languages : en
Pages : 764
Book Description
This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.
Publisher: Springer Science & Business Media
ISBN: 3540206957
Category : Computers
Languages : en
Pages : 764
Book Description
This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.
CWI Quarterly
Algorithms and Data Structures
Author: Frank Dehne
Publisher: Springer Science & Business Media
ISBN: 9783540571551
Category : Computers
Languages : en
Pages : 656
Book Description
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.
Publisher: Springer Science & Business Media
ISBN: 9783540571551
Category : Computers
Languages : en
Pages : 656
Book Description
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.
Bioinformatics Research and Application
Author: Jianer Chen
Publisher: Springer
ISBN: 3642212603
Category : Computers
Languages : en
Pages : 466
Book Description
This volume constitutes the refereed proceedings of the 7th International Symposium on Bioinformatics Research and Applications, ISBRA 2011, held in Changsha, China, in May 2011. The 36 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 92 submissions. Topics presented span all areas of bioinformatics and computational biology, including the development of experimental or commercial systems.
Publisher: Springer
ISBN: 3642212603
Category : Computers
Languages : en
Pages : 466
Book Description
This volume constitutes the refereed proceedings of the 7th International Symposium on Bioinformatics Research and Applications, ISBRA 2011, held in Changsha, China, in May 2011. The 36 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 92 submissions. Topics presented span all areas of bioinformatics and computational biology, including the development of experimental or commercial systems.
Multigrid Methods for Process Simulation
Author: Wolfgang Joppich
Publisher: Springer Science & Business Media
ISBN: 3709192536
Category : Technology & Engineering
Languages : en
Pages : 327
Book Description
It was about 1985 when both of the authors started their work using multigrid methods for process simulation problems. This happened in dependent from each other, with a completely different background and different intentions in mind. At this time, some important monographs appeared or have been in preparation. There are the three "classical" ones, from our point of view: the so-called "1984 Guide" [12J by Brandt, the "Multi-Grid Methods and Applications" [49J by Hackbusch and the so-called "Fundamentals" [132J by Stiiben and Trottenberg. Stiiben and Trottenberg in [132J state a "delayed acceptance, resent ments" with respect to multigrid algorithms. They complain: "Nevertheless, even today's situation is still unsatisfactory in several respects. If this is true for the development of standard methods, it applies all the more to the area of really difficult, complex applications." In spite of all the above mentioned publications and without ignoring important theoretical and practical improvements of multigrid, this situa tion has not yet changed dramatically. This statement is made under the condition that a numerical principle like multigrid is "accepted", if there exist "professional" programs for research and production purposes. "Professional" in this context stands for "solving complex technical prob lems in an industrial environment by a large community of users". Such a use demands not only for fast solution methods but also requires a high robustness with respect to the physical parameters of the problem.
Publisher: Springer Science & Business Media
ISBN: 3709192536
Category : Technology & Engineering
Languages : en
Pages : 327
Book Description
It was about 1985 when both of the authors started their work using multigrid methods for process simulation problems. This happened in dependent from each other, with a completely different background and different intentions in mind. At this time, some important monographs appeared or have been in preparation. There are the three "classical" ones, from our point of view: the so-called "1984 Guide" [12J by Brandt, the "Multi-Grid Methods and Applications" [49J by Hackbusch and the so-called "Fundamentals" [132J by Stiiben and Trottenberg. Stiiben and Trottenberg in [132J state a "delayed acceptance, resent ments" with respect to multigrid algorithms. They complain: "Nevertheless, even today's situation is still unsatisfactory in several respects. If this is true for the development of standard methods, it applies all the more to the area of really difficult, complex applications." In spite of all the above mentioned publications and without ignoring important theoretical and practical improvements of multigrid, this situa tion has not yet changed dramatically. This statement is made under the condition that a numerical principle like multigrid is "accepted", if there exist "professional" programs for research and production purposes. "Professional" in this context stands for "solving complex technical prob lems in an industrial environment by a large community of users". Such a use demands not only for fast solution methods but also requires a high robustness with respect to the physical parameters of the problem.
Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
Author:
Publisher: SIAM
ISBN: 9780898713138
Category : Mathematics
Languages : en
Pages : 532
Book Description
Annotation Proceedings of a conference that took place in Austin, Texas in January 1993. Contributors are impressive names from the field of computer science, including Donald Knuth, author of several computer books of "biblical" importance. The diverse selection of paper topics includes dynamic point location, ray shooting, and the shortest paths in planar maps; optimistic sorting and information theoretic complexity; and an optimal randomized algorithm for the cow-path problem. No index. Annotation copyright by Book News, Inc., Portland, OR.
Publisher: SIAM
ISBN: 9780898713138
Category : Mathematics
Languages : en
Pages : 532
Book Description
Annotation Proceedings of a conference that took place in Austin, Texas in January 1993. Contributors are impressive names from the field of computer science, including Donald Knuth, author of several computer books of "biblical" importance. The diverse selection of paper topics includes dynamic point location, ray shooting, and the shortest paths in planar maps; optimistic sorting and information theoretic complexity; and an optimal randomized algorithm for the cow-path problem. No index. Annotation copyright by Book News, Inc., Portland, OR.
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges
Author: Michael H. Goldwasser
Publisher: American Mathematical Soc.
ISBN: 0821828924
Category : Computers
Languages : en
Pages : 272
Book Description
The 11 papers are from two workshops: one in 1995-95 on dictionaries and priority queues, and the other in 1998-99 on near neighbor searches, the fifth and sixth DIMACS Algorithm Implementation Challenges initiated in 1991. They address those challenges with considerations of a practical perfect hashing algorithm, locally lifting the curse of dimensionality for a nearest neighbor search, and other topics. They also discuss methodology for the experimental analysis of algorithms. They are not indexed. Annotation copyrighted by Book News, Inc., Portland, OR.
Publisher: American Mathematical Soc.
ISBN: 0821828924
Category : Computers
Languages : en
Pages : 272
Book Description
The 11 papers are from two workshops: one in 1995-95 on dictionaries and priority queues, and the other in 1998-99 on near neighbor searches, the fifth and sixth DIMACS Algorithm Implementation Challenges initiated in 1991. They address those challenges with considerations of a practical perfect hashing algorithm, locally lifting the curse of dimensionality for a nearest neighbor search, and other topics. They also discuss methodology for the experimental analysis of algorithms. They are not indexed. Annotation copyrighted by Book News, Inc., Portland, OR.