Edizione	[1st ed. 2007.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica	1 online resource (XII, 311 p.)
Disciplina	005.52
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Data structures (Computer science) Information theory Data mining Artificial intelligence Database management Artificial intelligence—Data processing Coding theory Data Structures and Information Theory Data Mining and Knowledge Discovery Artificial Intelligence Database Management Data Science Coding and Information Theory
ISBN	3-540-75530-6
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences -- Edge-Guided Natural Language Text Compression -- Local Transpositions in Alignment of Polyphonic Musical Sequences -- Efficient Computations of ?1 and ???? Rearrangement Distances -- Generalized LCS -- Exploiting Genre in Focused Crawling -- Admission Policies for Caches of Search Engine Results -- A Pocket Guide to Web History -- Jump-Matching with Errors -- Estimating Number of Citations Using Author Reputation -- A Fast and Compact Web Graph Representation -- A Filtering Algorithm for k-Mismatch with Don’t Cares -- Compact Set Representation for Information Retrieval -- Approximate Swap and Mismatch Edit Distance -- Approximating Constrained LCS -- Tuning Approximate Boyer-Moore for Gene Sequences -- Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage -- Indexing a Dictionary for Subset Matching Queries -- Extending Weighting Models with a Term Quality Measure -- Highly Frequent Terms and Sentence Retrieval -- Implicit Compression Boosting with Applications to Self-indexing -- A Web-Page Usage Prediction Scheme Using Weighted Suffix Trees -- Enhancing Educational-Material Retrieval Using Authored-Lesson Metadata -- Approximate String Matching with Lempel-Ziv Compressed Indexes -- Algorithms for Weighted Matching -- Efficient Text Proximity Search -- Prefix-Shuffled Geometric Suffix Tree.
Record Nr.	UNISA-996465646703316

Edizione	[1st ed. 2006.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica	1 online resource (XIV, 370 p.)
Disciplina	025.04
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Information storage and retrieval systems Artificial intelligence Database management Artificial intelligence—Data processing Coding theory Information theory Algorithms Information Storage and Retrieval Artificial Intelligence Database Management Data Science Coding and Information Theory
ISBN	3-540-45775-5
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	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.
Record Nr.	UNISA-996466108803316

Edizione	[1st ed. 2005.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica	1 online resource (XIV, 410 p.)
Disciplina	005.52
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Data structures (Computer science) Information theory Information storage and retrieval systems Artificial intelligence Database management Artificial intelligence—Data processing Algorithms Data Structures and Information Theory Information Storage and Retrieval Artificial Intelligence Database Management Data Science
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	String Processing and Information Retrieval 2005 -- Enhanced Byte Codes with Restricted Prefix Properties -- Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences -- Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups -- XML Retrieval with a Natural Language Interface -- Recommending Better Queries from Click-Through Data -- A Bilingual Linking Service for the Web -- Evaluating Hierarchical Clustering of Search Results -- Counting Suffix Arrays and Strings -- Towards Real-Time Suffix Tree Construction -- Rank-Sensitive Data Structures -- Cache-Conscious Collision Resolution in String Hash Tables -- Measuring the Difficulty of Distance-Based Indexing -- N-Gram Similarity and Distance -- Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces -- Classifying Sentences Using Induced Structure -- Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity -- Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity -- Lydia: A System for Large-Scale News Analysis -- Composite Pattern Discovery for PCR Application -- Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array -- Linear Time Algorithm for the Generalised Longest Common Repeat Problem -- Application of Clustering Technique in Multiple Sequence Alignment -- Stemming Arabic Conjunctions and Prepositions -- XML Multimedia Retrieval -- Retrieval Status Values in Information Retrieval Evaluation -- A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting -- Necklace Swap Problem for Rhythmic Similarity Measures -- Faster Generation of Super Condensed Neighbourhoods Using Finite Automata -- Restricted Transposition Invariant Approximate String Matching Under Edit Distance -- Fast Plagiarism Detection System -- A Model for Information Retrieval Based on Possibilistic Networks -- Comparison of Representations of Multiple Evidence Using a Functional Framework for IR -- Deriving TF-IDF as a Fisher Kernel -- Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem -- Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty -- L 1 Pattern Matching Lower Bound -- Approximate Matching in the L ??? Metric -- An Edit Distance Between RNA Stem-Loops -- A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison -- Normalized Similarity of RNA Sequences -- A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees -- Practical and Optimal String Matching -- A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC’s -- A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching.
Record Nr.	UNISA-996465726303316

Edizione	[1st ed. 2019.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica	1 online resource (XXI, 368 p. 301 illus., 26 illus. in color.)
Disciplina	004.36
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer engineering Computer networks Operating systems (Computers) Robotics Computer science - Mathematics Discrete mathematics Artificial intelligence - Data processing Computer Engineering and Networks Operating Systems Discrete Mathematics in Computer Science Data Science
ISBN	3-030-24922-0
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	A Topological Perspective on Distributed Network Algorithms -- On Sense of Direction and Mobile Agents -- Locality of not-so-weak coloring -- Near-gathering of energy-constrained mobile agents -- Optimal Multi Broadcast with Beeps using Group Testing -- Tracking Routes in Communication Networks -- Positional Encoding by Robots with Non-Rigid Movements -- Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights -- Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory -- Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots -- Asynchronous Rendezvous with Different Maps -- Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies -- Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model -- Evacuating Two Robots from a Disk: A Second Cut -- Distributed pattern formation in a ring -- On Distributed Merlin-Arthur Decision Protocols -- Anonymous Read/Write Memory: Leader Election and Desanonymization -- Faster Construction of Overlay Networks -- Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings -- Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects -- Making Randomized Algorithms Self-Stabilizing -- How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning -- Self-Adjusting Line Networks -- Mutual Visibility for Asynchronous Robots -- Infinite Grid Exploration by Disoriented Robots -- A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks -- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds -- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault -- Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time -- Visiting Infinitely Often the Unit Interval while Minimizing the Idle-time of High Priority Points.
Record Nr.	UNISA-996466215803316

Edizione	[1st ed. 2018.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica	1 online resource (XIX, 410 p. 62 illus., 19 illus. in color.)
Disciplina	004.36
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer engineering Computer networks Operating systems (Computers) Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer Engineering and Networks Operating Systems Data Science Discrete Mathematics in Computer Science
ISBN	3-030-01325-1
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNISA-996466295703316