top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Advances in Databases [[electronic resource] ] : 28th British National Conference on Databases, BNCOD 28, Manchester, UK, July 12-14, 2011, Revised Selected Papers / / edited by Alvaro A.A. Fernandes, Alasdair J.G. Gray, Khalid Belhajjame
Advances in Databases [[electronic resource] ] : 28th British National Conference on Databases, BNCOD 28, Manchester, UK, July 12-14, 2011, Revised Selected Papers / / edited by Alvaro A.A. Fernandes, Alasdair J.G. Gray, Khalid Belhajjame
Edizione [1st ed. 2011.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Descrizione fisica 1 online resource (XI, 238 p. 94 illus.)
Disciplina 005.74
Collana Information Systems and Applications, incl. Internet/Web, and HCI
Soggetto topico Database management
Information storage and retrieval
Application software
Computers
Data structures (Computer science)
Database Management
Information Storage and Retrieval
Information Systems Applications (incl. Internet)
Information Systems and Communication Service
Data Structures
Data Storage Representation
ISBN 3-642-24577-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996466027503316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in Focused Retrieval [[electronic resource] ] : 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2009. Revised and Selected Papers / / edited by Shlomo Geva, Jaap Kamps, Andrew Trotman
Advances in Focused Retrieval [[electronic resource] ] : 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2009. Revised and Selected Papers / / edited by Shlomo Geva, Jaap Kamps, Andrew Trotman
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XIV, 484 p.)
Disciplina 004
Collana Information Systems and Applications, incl. Internet/Web, and HCI
Soggetto topico Information storage and retrieval
Data mining
Database management
Application software
Data structures (Computer science)
Information Storage and Retrieval
Data Mining and Knowledge Discovery
Database Management
Information Systems Applications (incl. Internet)
Data Storage Representation
Data Structures
ISBN 3-642-03761-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Ad Hoc Track -- Overview of the INEX 2008 Ad Hoc Track -- Experiments with Proximity-Aware Scoring for XML Retrieval at INEX 2008 -- Finding Good Elements for Focused Retrieval -- New Utility Models for the Garnata Information Retrieval System at INEX’08 -- UJM at INEX 2008: Pre-impacting of Tags Weights -- Use of Multiword Terms and Query Expansion for Interactive Information Retrieval -- Enhancing Keyword Search with a Keyphrase Index -- CADIAL Search Engine at INEX -- Indian Statistical Institute at INEX 2008 Adhoc Track -- Using Collectionlinks and Documents as Context for INEX 2008 -- SPIRIX: A Peer-to-Peer Search Engine for XML-Retrieval -- Book Track -- Overview of the INEX 2008 Book Track -- XRCE Participation to the Book Structure Task -- University of Waterloo at INEX 2008: Adhoc, Book, and Link-the-Wiki Tracks -- The Impact of Document Level Ranking on Focused Retrieval -- Adhoc and Book XML Retrieval with Cheshire -- Book Layout Analysis: TOC Structure Extraction Engine -- The Impact of Query Length and Document Length on Book Search Effectiveness -- Efficiency Track -- Overview of the INEX 2008 Efficiency Track -- Exploiting User Navigation to Improve Focused Retrieval -- Efficient XML and Entity Retrieval with PF/Tijah: CWI and University of Twente at INEX’08 -- Pseudo Relevance Feedback Using Fast XML Retrieval -- TopX 2.0 at the INEX 2008 Efficiency Track -- Aiming for Efficiency by Detecting Structural Similarity -- Entity Ranking Track -- Overview of the INEX 2008 Entity Ranking Track -- L3S at INEX 2008: Retrieving Entities Using Structured Information -- Adapting Language Modeling Methods for Expert Search to Rank Wikipedia Entities -- Finding Entities in Wikipedia Using Links and Categories -- Topic Difficulty Prediction in Entity Ranking -- A Generative Language Modeling Approach for Ranking Entities -- Interactive Track -- Overview of the INEX 2008 Interactive Track -- Link the Wiki Track -- Overview of the INEX 2008 Link the Wiki Track -- Link-the-Wiki: Performance Evaluation Based on Frequent Phrases -- CMIC@INEX 2008: Link-the-Wiki Track -- Stealing Anchors to Link the Wiki -- Context Based Wikipedia Linking -- Link Detection with Wikipedia -- Wikisearching and Wikilinking -- CSIR at INEX 2008 Link-the-Wiki Track -- A Content-Based Link Detection Approach Using the Vector Space Model -- XML Mining Track -- Overview of the INEX 2008 XML Mining Track -- Semi-supervised Categorization of Wikipedia Collection by Label Expansion -- Document Clustering with K-tree -- Using Links to Classify Wikipedia Pages -- Clustering XML Documents Using Frequent Subtrees -- UJM at INEX 2008 XML Mining Track -- Probabilistic Methods for Link-Based Classification at INEX 2008 -- Utilizing the Structure and Content Information for XML Document Clustering -- Self Organizing Maps for the Clustering of Large Sets of Labeled Graphs.
Record Nr. UNISA-996465653803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in Focused Retrieval : 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2009. Revised and Selected Papers / / edited by Shlomo Geva, Jaap Kamps, Andrew Trotman
Advances in Focused Retrieval : 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2009. Revised and Selected Papers / / edited by Shlomo Geva, Jaap Kamps, Andrew Trotman
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XIV, 484 p.)
Disciplina 004
Collana Information Systems and Applications, incl. Internet/Web, and HCI
Soggetto topico Information storage and retrieval
Data mining
Database management
Application software
Data structures (Computer science)
Information Storage and Retrieval
Data Mining and Knowledge Discovery
Database Management
Information Systems Applications (incl. Internet)
Data Storage Representation
Data Structures
ISBN 3-642-03761-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Ad Hoc Track -- Overview of the INEX 2008 Ad Hoc Track -- Experiments with Proximity-Aware Scoring for XML Retrieval at INEX 2008 -- Finding Good Elements for Focused Retrieval -- New Utility Models for the Garnata Information Retrieval System at INEX’08 -- UJM at INEX 2008: Pre-impacting of Tags Weights -- Use of Multiword Terms and Query Expansion for Interactive Information Retrieval -- Enhancing Keyword Search with a Keyphrase Index -- CADIAL Search Engine at INEX -- Indian Statistical Institute at INEX 2008 Adhoc Track -- Using Collectionlinks and Documents as Context for INEX 2008 -- SPIRIX: A Peer-to-Peer Search Engine for XML-Retrieval -- Book Track -- Overview of the INEX 2008 Book Track -- XRCE Participation to the Book Structure Task -- University of Waterloo at INEX 2008: Adhoc, Book, and Link-the-Wiki Tracks -- The Impact of Document Level Ranking on Focused Retrieval -- Adhoc and Book XML Retrieval with Cheshire -- Book Layout Analysis: TOC Structure Extraction Engine -- The Impact of Query Length and Document Length on Book Search Effectiveness -- Efficiency Track -- Overview of the INEX 2008 Efficiency Track -- Exploiting User Navigation to Improve Focused Retrieval -- Efficient XML and Entity Retrieval with PF/Tijah: CWI and University of Twente at INEX’08 -- Pseudo Relevance Feedback Using Fast XML Retrieval -- TopX 2.0 at the INEX 2008 Efficiency Track -- Aiming for Efficiency by Detecting Structural Similarity -- Entity Ranking Track -- Overview of the INEX 2008 Entity Ranking Track -- L3S at INEX 2008: Retrieving Entities Using Structured Information -- Adapting Language Modeling Methods for Expert Search to Rank Wikipedia Entities -- Finding Entities in Wikipedia Using Links and Categories -- Topic Difficulty Prediction in Entity Ranking -- A Generative Language Modeling Approach for Ranking Entities -- Interactive Track -- Overview of the INEX 2008 Interactive Track -- Link the Wiki Track -- Overview of the INEX 2008 Link the Wiki Track -- Link-the-Wiki: Performance Evaluation Based on Frequent Phrases -- CMIC@INEX 2008: Link-the-Wiki Track -- Stealing Anchors to Link the Wiki -- Context Based Wikipedia Linking -- Link Detection with Wikipedia -- Wikisearching and Wikilinking -- CSIR at INEX 2008 Link-the-Wiki Track -- A Content-Based Link Detection Approach Using the Vector Space Model -- XML Mining Track -- Overview of the INEX 2008 XML Mining Track -- Semi-supervised Categorization of Wikipedia Collection by Label Expansion -- Document Clustering with K-tree -- Using Links to Classify Wikipedia Pages -- Clustering XML Documents Using Frequent Subtrees -- UJM at INEX 2008 XML Mining Track -- Probabilistic Methods for Link-Based Classification at INEX 2008 -- Utilizing the Structure and Content Information for XML Document Clustering -- Self Organizing Maps for the Clustering of Large Sets of Labeled Graphs.
Record Nr. UNINA-9910483577603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in Spatial Databases [[electronic resource] ] : 4th International Symposium SSD '95, Portland, ME, USA, August 6 - 9, 1995. Proceedings / / edited by Max J. Egenhofer, John R. Herring
Advances in Spatial Databases [[electronic resource] ] : 4th International Symposium SSD '95, Portland, ME, USA, August 6 - 9, 1995. Proceedings / / edited by Max J. Egenhofer, John R. Herring
Edizione [1st ed. 1995.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995
Descrizione fisica 1 online resource (XIV, 410 p.)
Disciplina 910/.285
Collana Lecture Notes in Computer Science
Soggetto topico Computers
Data structures (Computer science)
Theory of Computation
Data Storage Representation
Data Structures and Information Theory
ISBN 3-540-49536-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Lossless representation of topological spatial data -- On the desirability and limitations of linear spatial database models -- The quad view data structure — a representation for planar subdivisions -- Discovery of spatial association rules in geographic information databases -- Knowledge discovery in large spatial databases: Focusing techniques for efficient class identification -- Ranking in spatial databases -- Optimal redundancy in spatial database systems -- Accessing geographical metafiles through a database storage system -- Extending a spatial access structure to support additional standard attributes -- Towards a formal model for multiresolution spatial maps -- Multi-Scale partitions: Application to spatial and statistical databases -- Specifying open GIS with functional languages -- Load-balancing in high performance GIS: Declustering polygonal maps -- Implementation of the ROSE algebra: Efficient algorithms for realm-based spatial data types -- A 3D molecular surface representation supporting neighborhood queries -- An inferencing language for automated spatial reasoning about graphic entities -- Inferences from combined knowledge about topology and directions -- 2D projection interval relationships: A symbolic representation of spatial relationships -- Topological relations between discrete regions -- Generating seeded trees from data sets -- Spatial join strategies in distributed spatial DBMS -- Comparison and benchmarks for import of VPF geographic data from object-oriented and relational database files -- Compressing Elevation Data.
Record Nr. UNISA-996466049803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in Spatial Databases [[electronic resource] ] : 2nd Symposium, SSD '91, Zurich, Switzerland, August 28-30, 1991. Proceedings / / edited by Oliver Günther, Hans-Jörg Schek
Advances in Spatial Databases [[electronic resource] ] : 2nd Symposium, SSD '91, Zurich, Switzerland, August 28-30, 1991. Proceedings / / edited by Oliver Günther, Hans-Jörg Schek
Edizione [1st ed. 1991.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991
Descrizione fisica 1 online resource (XII, 476 p.)
Disciplina 005.74
Collana Lecture Notes in Computer Science
Soggetto topico Data structures (Computer science)
Geographical information systems
Computer programming
Database management
Artificial intelligence
Data Structures and Information Theory
Geographical Information Systems/Cartography
Programming Techniques
Database Management
Data Storage Representation
Artificial Intelligence
ISBN 3-540-47615-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Geometric algorithms and their complexity -- The combination of spatial access methods and computational geometry in geographic database systems -- FI-Quadtree: a new data structure for content-oriented retrieval and fuzzy search -- The importance of metaknowledge for environmental information systems -- An extended object-oriented data model for large image bases -- On the integration of GIS and remotely sensed data: Towards an integrated system to handle the large volume of spatial data -- Towards a toolbox for geographic user interfaces -- The management of the ambiguities in a graphical query language for geographical information systems -- Geo-SAL: A query language for spatial data analysis -- Reasoning about binary topological relations -- Topological constraints: A representational framework for approximate spatial and temporal reasoning -- Grow and post index trees: Role, techniques and future potential -- The spatial locality and a spatial indexing method by dynamic clustering in hypermap system -- Properties of geographic data: Requirements for spatial access methods -- Efficient processing of spatial queries in line segment databases -- The performance of object decomposition techniques for spatial query processing -- Performance comparison of segment access methods implemented on top of the buddy-tree -- Extending a DBMS with spatial operations -- The use of a complex object language in geographic data management -- Motion in a geographical database system -- A spatial index for convex simplicial complexes in d dimensions -- An algorithm for computing the overlay of k-dimensional spaces -- Encoding and manipulating pictorial data with S+-trees -- Exploiting extensible DBMS in integrated geographic information systems -- Storage management in geographic information systems -- Pannel: Why does GIS industry ignore university research?.
Record Nr. UNISA-996465285703316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in User Authentication / / by Dipankar Dasgupta, Arunava Roy, Abhijit Nag
Advances in User Authentication / / by Dipankar Dasgupta, Arunava Roy, Abhijit Nag
Autore Dasgupta Dipankar
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (369 pages)
Disciplina 004
Collana Infosys Science Foundation Series in Applied Sciences and Engineering
Soggetto topico Coding theory
Information theory
Computer security
Data structures (Computer science)
Biometrics (Biology)
Coding and Information Theory
Systems and Data Security
Data Storage Representation
Biometrics
ISBN 3-319-58808-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Authentication Basics -- Biometric Authentication -- Negative Authentication Systems -- Pseudo-Passwords and Non-Textual Approaches -- Multi-Factor Authentication -- Continuous Authentication -- Adaptive Multi-Factor Authentication.
Record Nr. UNINA-9910254831403321
Dasgupta Dipankar  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms - ESA 2009 [[electronic resource] ] : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, Proceedings / / edited by Amos Fiat, Peter Sanders
Algorithms - ESA 2009 [[electronic resource] ] : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, Proceedings / / edited by Amos Fiat, Peter Sanders
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XIX, 790 p.)
Disciplina 005.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Information retrieval
Computer architecture
Artificial intelligence—Data processing
Computer science—Mathematics
Computer networks
Programming Techniques
Data Storage Representation
Data Science
Mathematics of Computing
Computer Communication Networks
ISBN 3-642-04128-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk -- Some Open Questions Related to Cuckoo Hashing -- Trees -- Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks -- Improved Approximation Algorithms for Label Cover Problems -- A Linear Time Algorithm for L(2,1)-Labeling of Trees -- Geometry I -- On Inducing Polygons and Related Problems -- Computing 3D Periodic Triangulations -- Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0 -- Mathematical Programming -- Approximability of Sparse Integer Programs -- Iterative Rounding for Multi-Objective Optimization Problems -- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity -- Geometry II -- Constructing Delaunay Triangulations along Space-Filling Curves -- Piercing Translates and Homothets of a Convex Body -- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs -- Algorithmic Game Theory I -- On Revenue Maximization in Second-Price Ad Auctions -- Clustering-Based Bidding Languages for Sponsored Search -- Altruism in Atomic Congestion Games -- Geometry III -- Geometric Spanners for Weighted Point Sets -- k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees -- Narrow-Shallow-Low-Light Trees with and without Steiner Points -- Algorithmic Game Theory II -- Bounded Budget Betweenness Centrality Game for Strategic Network Formations -- Exact and Approximate Equilibria for Optimal Group Network Formation -- On the Performance of Approximate Equilibria in Congestion Games -- Navigation and Routing -- Optimality and Competitiveness of Exploring Polygons by Mobile Robots -- Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links -- Dynamic vs. Oblivious Routing in Network Design -- Invited Talk -- Algorithms Meet Art, Puzzles, and Magic -- Graphs and Point Sets -- Polynomial-Time Algorithm for the Leafage of Chordal Graphs -- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases -- Shape Fitting on Point Sets with Probability Distributions -- Bioinformatics -- An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract) -- Complete Parsimony Haplotype Inference Problem and Algorithms -- Linear-Time Recognition of Probe Interval Graphs -- Wireless Communications -- Wireless Scheduling with Power Control -- On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources -- Approximability of OFDMA Scheduling -- Flows, Matrices, Compression -- Maximum Flow in Directed Planar Graphs with Vertex Capacities -- A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication -- On Optimally Partitioning a Text to Improve Its Compression -- Scheduling -- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling -- Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling -- Preemptive Online Scheduling with Reordering -- Streaming -- d-Dimensional Knapsack in the Streaming Model -- Sparse Cut Projections in Graph Streams -- Bipartite Graph Matchings in the Semi-streaming Model -- Online Algorithms -- The Oil Searching Problem -- Hyperbolic Dovetailing -- Bluetooth and Dial a Ride -- On the Expansion and Diameter of Bluetooth-Like Topologies -- Minimum Makespan Multi-vehicle Dial-a-Ride -- Invited Talk -- Google’s Auction for TV Ads -- Decomposition and Covering -- Inclusion/Exclusion Meets Measure and Conquer -- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution -- Counting Paths and Packings in Halves -- Algorithm Engineering -- Accelerating Multi-modal Route Planning by Access-Nodes -- Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation -- Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem -- Parameterized Algorithms I -- Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth -- Kernel Bounds for Disjoint Cycles and Disjoint Paths -- Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem -- Data Structures -- Rank-Pairing Heaps -- 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit -- Hash, Displace, and Compress -- Parameterized Algorithms II -- Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels -- Contraction Bidimensionality: The Accurate Picture -- Minimizing Movement: Fixed-Parameter Tractability -- Hashing and Lowest Common Ancestor -- Storing a Compressed Function with Constant Time Access -- Experimental Variations of a Theoretically Good Retrieval Data Structure -- Short Labels for Lowest Common Ancestors in Trees -- Best Paper Awards -- Disproof of the Neighborhood Conjecture with Implications to SAT -- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard.
Record Nr. UNISA-996465672303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms - ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, Proceedings / / edited by Amos Fiat, Peter Sanders
Algorithms - ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, Proceedings / / edited by Amos Fiat, Peter Sanders
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XIX, 790 p.)
Disciplina 005.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Information retrieval
Computer architecture
Artificial intelligence—Data processing
Computer science—Mathematics
Computer networks
Programming Techniques
Data Storage Representation
Data Science
Mathematics of Computing
Computer Communication Networks
ISBN 3-642-04128-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk -- Some Open Questions Related to Cuckoo Hashing -- Trees -- Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks -- Improved Approximation Algorithms for Label Cover Problems -- A Linear Time Algorithm for L(2,1)-Labeling of Trees -- Geometry I -- On Inducing Polygons and Related Problems -- Computing 3D Periodic Triangulations -- Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0 -- Mathematical Programming -- Approximability of Sparse Integer Programs -- Iterative Rounding for Multi-Objective Optimization Problems -- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity -- Geometry II -- Constructing Delaunay Triangulations along Space-Filling Curves -- Piercing Translates and Homothets of a Convex Body -- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs -- Algorithmic Game Theory I -- On Revenue Maximization in Second-Price Ad Auctions -- Clustering-Based Bidding Languages for Sponsored Search -- Altruism in Atomic Congestion Games -- Geometry III -- Geometric Spanners for Weighted Point Sets -- k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees -- Narrow-Shallow-Low-Light Trees with and without Steiner Points -- Algorithmic Game Theory II -- Bounded Budget Betweenness Centrality Game for Strategic Network Formations -- Exact and Approximate Equilibria for Optimal Group Network Formation -- On the Performance of Approximate Equilibria in Congestion Games -- Navigation and Routing -- Optimality and Competitiveness of Exploring Polygons by Mobile Robots -- Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links -- Dynamic vs. Oblivious Routing in Network Design -- Invited Talk -- Algorithms Meet Art, Puzzles, and Magic -- Graphs and Point Sets -- Polynomial-Time Algorithm for the Leafage of Chordal Graphs -- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases -- Shape Fitting on Point Sets with Probability Distributions -- Bioinformatics -- An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract) -- Complete Parsimony Haplotype Inference Problem and Algorithms -- Linear-Time Recognition of Probe Interval Graphs -- Wireless Communications -- Wireless Scheduling with Power Control -- On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources -- Approximability of OFDMA Scheduling -- Flows, Matrices, Compression -- Maximum Flow in Directed Planar Graphs with Vertex Capacities -- A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication -- On Optimally Partitioning a Text to Improve Its Compression -- Scheduling -- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling -- Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling -- Preemptive Online Scheduling with Reordering -- Streaming -- d-Dimensional Knapsack in the Streaming Model -- Sparse Cut Projections in Graph Streams -- Bipartite Graph Matchings in the Semi-streaming Model -- Online Algorithms -- The Oil Searching Problem -- Hyperbolic Dovetailing -- Bluetooth and Dial a Ride -- On the Expansion and Diameter of Bluetooth-Like Topologies -- Minimum Makespan Multi-vehicle Dial-a-Ride -- Invited Talk -- Google’s Auction for TV Ads -- Decomposition and Covering -- Inclusion/Exclusion Meets Measure and Conquer -- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution -- Counting Paths and Packings in Halves -- Algorithm Engineering -- Accelerating Multi-modal Route Planning by Access-Nodes -- Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation -- Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem -- Parameterized Algorithms I -- Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth -- Kernel Bounds for Disjoint Cycles and Disjoint Paths -- Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem -- Data Structures -- Rank-Pairing Heaps -- 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit -- Hash, Displace, and Compress -- Parameterized Algorithms II -- Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels -- Contraction Bidimensionality: The Accurate Picture -- Minimizing Movement: Fixed-Parameter Tractability -- Hashing and Lowest Common Ancestor -- Storing a Compressed Function with Constant Time Access -- Experimental Variations of a Theoretically Good Retrieval Data Structure -- Short Labels for Lowest Common Ancestors in Trees -- Best Paper Awards -- Disproof of the Neighborhood Conjecture with Implications to SAT -- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard.
Record Nr. UNINA-9910484926803321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms for Memory Hierarchies [[electronic resource] ] : Advanced Lectures / / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn
Algorithms for Memory Hierarchies [[electronic resource] ] : Advanced Lectures / / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Descrizione fisica 1 online resource (XV, 429 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer engineering
Algorithms
Software engineering
Operating systems (Computers)
Data structures (Computer science)
Computer Engineering
Algorithm Analysis and Problem Complexity
Software Engineering
Operating Systems
Data Storage Representation
Data Structures and Information Theory
ISBN 3-540-36574-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Memory Hierarchies — Models and Lower Bounds -- Basic External Memory Data Structures -- A Survey of Techniques for Designing I/O-Efficient Algorithms -- Elementary Graph Algorithms in External Memory -- I/O-Efficient Algorithms for Sparse Graphs -- External Memory Computational Geometry Revisited -- Full-Text Indexes in External Memory -- Algorithms for Hardware Caches and TLB -- Cache Oblivious Algorithms -- An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms -- Memory Limitations in Artificial Intelligence -- Algorithmic Approaches for Storage Networks -- An Overview of File System Architectures -- Exploitation of the Memory Hierarchy in Relational DBMSs -- Hierarchical Models and Software Tools for Parallel Programming -- Case Study: Memory Conscious Parallel Sorting.
Record Nr. UNISA-996466147303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms for Memory Hierarchies : Advanced Lectures / / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn
Algorithms for Memory Hierarchies : Advanced Lectures / / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Descrizione fisica 1 online resource (XV, 429 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer engineering
Algorithms
Software engineering
Operating systems (Computers)
Data structures (Computer science)
Computer Engineering
Algorithm Analysis and Problem Complexity
Software Engineering
Operating Systems
Data Storage Representation
Data Structures and Information Theory
ISBN 3-540-36574-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Memory Hierarchies — Models and Lower Bounds -- Basic External Memory Data Structures -- A Survey of Techniques for Designing I/O-Efficient Algorithms -- Elementary Graph Algorithms in External Memory -- I/O-Efficient Algorithms for Sparse Graphs -- External Memory Computational Geometry Revisited -- Full-Text Indexes in External Memory -- Algorithms for Hardware Caches and TLB -- Cache Oblivious Algorithms -- An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms -- Memory Limitations in Artificial Intelligence -- Algorithmic Approaches for Storage Networks -- An Overview of File System Architectures -- Exploitation of the Memory Hierarchy in Relational DBMSs -- Hierarchical Models and Software Tools for Parallel Programming -- Case Study: Memory Conscious Parallel Sorting.
Record Nr. UNINA-9910145911103321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui