feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Cambridge ; : Cambridge University Press,
    UID:
    almahu_9949534942402882
    Format: 1 online resource (xii, 305 pages) : , digital, PDF file(s).
    ISBN: 9781009128933 (ebook)
    Content: There are many textbooks on algorithms focusing on big-O notation and basic design principles. This book offers a unique approach to taking the design and analyses to the level of predictable practical efficiency, discussing core and classic algorithmic problems that arise in the development of big data applications, and presenting elegant solutions of increasing sophistication and efficiency. Solutions are analyzed within the classic RAM model, and the more practically significant external-memory model that allows one to perform I/O-complexity evaluations. Chapters cover various data types, including integers, strings, trees, and graphs, algorithmic tools such as sampling, sorting, data compression, and searching in dictionaries and texts, and lastly, recent developments regarding compressed data structures. Algorithmic solutions are accompanied by detailed pseudocode and many running examples, thus enriching the toolboxes of students, researchers, and professionals interested in effective and efficient processing of big data.
    Note: Title from publisher's bibliographic system (viewed on 12 Jun 2023). , A warm-up! -- Random sampling -- List ranking -- Sorting atomic items -- Set intersection -- Sorting strings -- The dictionary problem -- Searching strings by prefix -- Searching strings by substring -- Integer coding -- Statistical coding -- Dictionary-based compressors -- The Burrows-Wheeler transform -- Compressed data structures.
    Additional Edition: Print version: ISBN 9781009123280
    Language: English
    Subjects: Computer Science
    RVK:
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_BV045885571
    Format: viii, 174 Seiten : , Illustrationen, Diagramme ; , 23.5 cm x 15.5 cm.
    ISBN: 978-3-319-97939-7 , 3-319-97939-6
    Additional Edition: Erscheint auch als Online-Ausgabe, eBook ISBN 978-3-319-97940-3
    Language: English
    Subjects: Computer Science , Biology
    RVK:
    RVK:
    Keywords: Algorithmus ; Informatik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_BV023351692
    Format: XIII, 315 S. : , graph. Darst.
    ISBN: 3-540-69066-2 , 978-3-540-69066-5
    Series Statement: Lecture notes in computer science 5029
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Mustervergleich ; Konferenzschrift ; Kongress ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Book
    Book
    Cambridge ; New York, NY :Cambridge University Press,
    UID:
    almahu_BV049087990
    Format: xii, 305 Seiten.
    ISBN: 978-1-009-12328-0
    Note: Literaturangaben
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-1-009-12893-3
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Algorithmus ; Softwareentwicklung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    b3kat_BV045165285
    Format: 1 Online-Ressource (VIII, 174 Seiten)
    ISBN: 9783319979403
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-319-97939-7
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-319-97941-0
    Language: English
    Subjects: Computer Science , Biology
    RVK:
    RVK:
    Keywords: Algorithmus ; Informatik
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    b3kat_BV023411801
    Format: 1 Online-Ressource (XIII, 315 S.) , graph. Darst.
    ISBN: 9783540690665 , 9783540690689
    Series Statement: Lecture notes in computer science 5029
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Mustervergleich ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    almahu_9947364487302882
    Format: XX, 839 p. 147 illus. , online resource.
    ISBN: 9783642330902
    Series Statement: Lecture Notes in Computer Science, 7501
    Content: This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching, quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
    Note: Algorithm engineering -- algorithmic aspects of networks -- algorithmic game theory -- approximation algorithms -- computational biology -- computational finance -- computational geometry -- combinatorial optimization -- data compression -- data structures.-databases and information retrieval -- distributed and parallel computing -- graph algorithms -- hierarchical memories -- heuristics and meta-heuristics -- mathematical programming -- mobile computing -- on-line algorithms -- parameterized complexity -- pattern matching, quantum computing -- randomized algorithms -- scheduling and resource allocation problems -- streaming algorithms.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783642330896
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    almahu_9947364210302882
    Format: XIII, 317 p. , online resource.
    ISBN: 9783540690689
    Series Statement: Lecture Notes in Computer Science, 5029
    Content: This book constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008. The 25 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 78 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching.
    Note: Invited Talks -- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations -- Lower Bounds for Succinct Data Structures -- The Changing Face of Web Search -- Contributed Papers -- Two-Dimensional Pattern Matching with Combined Scaling and Rotation -- Searching for Gapped Palindromes -- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems -- Finding Largest Well-Predicted Subset of Protein Structure Models -- HP Distance Via Double Cut and Join Distance -- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots -- Faster Algorithm for the Set Variant of the String Barcoding Problem -- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics -- Analysis of the Size of Antidictionary in DCA -- Approximate String Matching with Address Bit Errors -- On-Line Approximate String Matching with Bounded Errors -- A Black Box for Online Approximate Pattern Matching -- An(other) Entropy-Bounded Compressed Suffix Tree -- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices -- Computing Inverse ST in Linear Complexity -- Dynamic Fully-Compressed Suffix Trees -- A Linear Delay Algorithm for Building Concept Lattices -- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares -- Fast Algorithms for Computing Tree LCS -- Why Greed Works for Shortest Common Superstring Problem -- Constrained LCS: Hardness and Approximation -- Finding Additive Biclusters with Random Background -- An Improved Succinct Representation for Dynamic k-ary Trees -- Towards a Solution to the “Runs” Conjecture -- On the Longest Common Parameterized Subsequence.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540690665
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    almahu_9947364057302882
    Format: XIV, 370 p. , online resource.
    ISBN: 9783540457756
    Series Statement: Lecture Notes in Computer Science, 4209
    Content: This volume contains the papers presented at the 13th International Symposium on String Processing and Information Retrieval (SPIRE), held October 11-13, 2006, in Glasgow, Scotland. The SPIRE annual symposium provides an opportunity for both new and established researchers to present original contributions to areas such as string processing (dictionary algorithms, text searching, pattern matching, text c- pression, text mining, natural language processing, and automata-based string processing); information retrieval languages, applications, and evaluation (IR modelling, indexing, ranking and ?ltering, interface design, visualization, cro- lingual IR systems, multimedia IR, digital libraries, collaborative retrieval, W- related applications, XML, information retrieval from semi-structured data, text mining, and generation of structured data from text); and interaction of biology and computation (sequencing and applications in molecular biology, evolution and phylogenetics, recognition of genes and regulatory elements, and sequen- driven protein structure prediction). The papers in this volume were selected from 102 papers submitted from over 20 di?erent countries in response to the Call for Papers. A total of 26 submissions were accepted as full papers, yielding an acceptance rate of about 25%. In view of the large number of good-quality submissions the Program Committee decided to accept 5 short papers, that have also been included in the proceedings. SPIRE 2006 also featured two talks by invited speakers: Jamie Callan (Carnegie Mellon University, USA) and Martin Farach-Colton (Rutgers University, USA).
    Note: Web Clustering and Text Categorization -- MP-Boost: A Multiple-Pivot Boosting Algorithm and Its Application to Text Categorization -- TreeBoost.MH: A Boosting Algorithm for Multi-label Hierarchical Text Categorization -- Cluster Generation and Cluster Labelling for Web Snippets: A Fast and Accurate Hierarchical Solution -- Principal Components for Automatic Term Hierarchy Building -- Strings -- Computing the Minimum Approximate ?-Cover of a String -- Sparse Directed Acyclic Word Graphs -- On-Line Repetition Detection -- User Behavior -- Analyzing User Behavior to Rank Desktop Items -- The Intention Behind Web Queries -- Web Search Algorithms -- Compact Features for Detection of Near-Duplicates in Distributed Retrieval -- Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory -- Efficient Lazy Algorithms for Minimal-Interval Semantics -- Output-Sensitive Autocompletion Search -- Compression -- A Compressed Self-index Using a Ziv-Lempel Dictionary -- Mapping Words into Codewords on PPM -- Correction -- Improving Usability Through Password-Corrective Hashing -- Word-Based Correction for Retrieval of Arabic OCR Degraded Documents -- Information Retrieval Applications -- A Statistical Model of Query Log Generation -- Using String Comparison in Context for Improved Relevance Feedback in Different Text Media -- A Multiple Criteria Approach for Information Retrieval -- English to Persian Transliteration -- Bio Informatics -- Efficient Algorithms for Pattern Matching with General Gaps and Character Classes -- Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions -- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy -- Web Search Engines -- Structured Index Organizations for High-Throughput Text Querying -- Adaptive Query-Based Sampling of Distributed Collections -- Short Papers -- Dotted Suffix Trees A Structure for Approximate Text Indexing -- Phrase-Based Pattern Matching in Compressed Text -- Discovering Context-Topic Rules in Search Engine Logs -- Incremental Aggregation of Latent Semantics Using a Graph-Based Energy Model -- A New Algorithm for Fast All-Against-All Substring Matching.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540457749
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    gbv_1651698600
    Format: Online-Ressource (XX, 839 p. 147 illus, digital)
    ISBN: 9783642330902
    Series Statement: Lecture notes in computer science 7501
    Content: Algorithm engineering -- algorithmic aspects of networks -- algorithmic game theory -- approximation algorithms -- computational biology -- computational finance -- computational geometry -- combinatorial optimization -- data compression -- data structures.-databases and information retrieval -- distributed and parallel computing -- graph algorithms -- hierarchical memories -- heuristics and meta-heuristics -- mathematical programming -- mobile computing -- on-line algorithms -- parameterized complexity -- pattern matching, quantum computing -- randomized algorithms -- scheduling and resource allocation problems -- streaming algorithms.
    Content: This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching, quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
    Note: Literaturangaben
    Additional Edition: ISBN 9783642330896
    Additional Edition: Erscheint auch als Druckausgabe ESA (20 : 2012 : Ljubljana) Algorithms - ESA 2012 Berlin : Springer, 2012 ISBN 9783642330896
    Additional Edition: ISBN 3642330894
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Algorithmus ; Algorithmus ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Author information: Epstein, Leah
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages