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)
Approximation Algorithms for Combinatorial Optimization [[electronic resource] ] : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani
Approximation Algorithms for Combinatorial Optimization [[electronic resource] ] : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (VIII, 276 p.)
Disciplina 004/.01/51
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Computers
Mathematical optimization
Algorithms
Computer science—Mathematics
Numerical analysis
Programming Techniques
Theory of Computation
Optimization
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
ISBN 3-540-45753-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Search and Classification of High Dimensional Data -- Bicriteria Spanning Tree Problems -- Improved Approximation Algorithms for Multilevel Facility Location Problems -- On Constrained Hypergraph Coloring and Scheduling -- On the Power of Priority Algorithms for Facility Location and Set Cover -- Two Approximation Algorithms for 3-Cycle Covers -- Approximation Algorithms for the Unsplittable Flow Problem -- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor -- Typical Rounding Problems -- Approximating Min-sum Set Cover -- Approximating Maximum Edge Coloring in Multigraphs -- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees -- A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs -- Facility Location and the Geometric Minimum-Diameter Spanning Tree -- Improved Approximation Algorithms for the Partial Vertex Cover Problem -- Minimum Restricted Diameter Spanning Trees -- Hardness of Approximation for Vertex-Connectivity Network-Design Problems -- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem -- Routing and Admission Control in Networks with Advance Reservations -- Improved Approximation Algorithms for Metric Facility Location Problems -- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products -- Primal-Dual Algorithms for Connected Facility Location Problems.
Record Nr. UNISA-996465517903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (VIII, 276 p.)
Disciplina 004/.01/51
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Computer science
Mathematical optimization
Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Programming Techniques
Theory of Computation
Optimization
Discrete Mathematics in Computer Science
Numerical Analysis
ISBN 3-540-45753-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Search and Classification of High Dimensional Data -- Bicriteria Spanning Tree Problems -- Improved Approximation Algorithms for Multilevel Facility Location Problems -- On Constrained Hypergraph Coloring and Scheduling -- On the Power of Priority Algorithms for Facility Location and Set Cover -- Two Approximation Algorithms for 3-Cycle Covers -- Approximation Algorithms for the Unsplittable Flow Problem -- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor -- Typical Rounding Problems -- Approximating Min-sum Set Cover -- Approximating Maximum Edge Coloring in Multigraphs -- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees -- A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs -- Facility Location and the Geometric Minimum-Diameter Spanning Tree -- Improved Approximation Algorithms for the Partial Vertex Cover Problem -- Minimum Restricted Diameter Spanning Trees -- Hardness of Approximation for Vertex-Connectivity Network-Design Problems -- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem -- Routing and Admission Control in Networks with Advance Reservations -- Improved Approximation Algorithms for Metric Facility Location Problems -- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products -- Primal-Dual Algorithms for Connected Facility Location Problems.
Record Nr. UNINA-9910143893203321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Arithmetic and logic in computer systems [[electronic resource] /] / Mi Lu
Arithmetic and logic in computer systems [[electronic resource] /] / Mi Lu
Autore Lu Mi
Edizione [1st edition]
Pubbl/distr/stampa Hoboken, NJ, : Wiley-Interscience, c2004
Descrizione fisica 1 online resource (270 p.)
Disciplina 004/.01/51
Collana Wiley Series in Microwave and Optical Engineering
Soggetto topico Computer arithmetic
Logic programming
ISBN 1-280-25336-3
9786610253364
0-470-35774-6
0-471-72621-4
0-471-72851-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Arithmetic and Logic in Computer Systems; Contents; Preface; List of Figures; List of Figures; List of Tables; List of Tables; About the Author; 1 Computer Number Systems; 1.1 Conventional Radix Number System; 1.2 Conversion of Radix Numbers; 1.3 Representation of Signed Numbers; 1.3.1 Sign-Magnitude; 1.3.2 Diminished Radix Complement; 1.3.3 Radix Complement; 1.4 Signed-Digit Number System; 1.1 Numbers Represented by 4 bits in Different Number Systems; 1.2 Finding Signed Digits; 1.5 Floating-point Number Representation; 1.5.1 Normalization; 1.5.2 Bias; 1.1 Floating-point Representation
1.2 Range of the Numbers1.3 Precision of Floating-Point Numbers; 1.4 Double Precision Floating-Point Representation; 1.3 Reserved Representation in IEEE Standard; 1.6 Residue Number System; 1.7 Logarithmic Number System; References; Problems; 2 Addition and Subtraction; 2.1 Single-Bit Adders; 2.1.1 Logical Devices; 2.1 AOI Function; 2.1 Delay Time and Area of Logic Gates; 2.2 Decoder and Multiplexer; 2.1.2 Single-Bit Half-Adder and Full-Adders; 2.3 Single-Bit Half-Adder; 2.2 Logic Function of a Half-Adder; 2.3 Logic Function of a Full-Adder; 2.4 Design of Full-Adder; 2.2 Negation
2.4 Single-Bit Subtractor2.2.1 Negation in One's Complement System; 2.5 Single-Bit Subtrator; 2.5 Negation in One's Complement System; 2.6 Negation in One's Complement System; 2.2.2 Negation in Two's Complement System; 2.7 Negation in Two's Complement System; 2.3 Subtraction through Addition; 2.8 Subtraction through Addition; 2.9 One-Bit Adder/Subtractor; 2.4 Over flow; 2.5 Ripple Carry Adders; 2.5.1 Two's Complement Addition; 2.10 Two's Complement Addition/Subtraction; 2.5.2 One's Complement Addition; 2.11 One's Complement Addition/Subtraction; 2.5.3 Sign-Magnitude Addition
2.12 Block Diagram of Sign-Magnitude Addition/SubtractionReferences; 2.13 Sign-Magnitude Addition/Subtraction; Problems; 3 High-Speed Adder; 3.1 Conditional-Sum Addition; 3.1 Conditional-Sum Addition; 3.2 Carry-Completion Sensing Addition; 3.2 Conditional-Sum Adder; 3.3 Generation and Transmission of Carries; 3.4 Construction of Carry-Completion Sensing Adder; 3.3 Carry-Lookahead Addition (CLA); 3.3.1 Carry-Lookahead Adder; 3.3.2 Block Carry Lookahead Adder; 3.5 Carry-Lookahead Adder; 3.6 Block Carry-Lookahead Adder; 3.4 Carry-Save Adders (CSA); 3.7 Carry-Save Adder; 3.8 Carry-Save Adder Tree
3.9 Two Types of Parallelization in Multi-Operand Addition3.5 Bit-Partitioned Multiple Addition; 3.1 Maximum Inputs of CSA Trees; 3.10 Bit-Partitioned Multiple Addition; References; Problems; 3.11 Carry-Completion Sensing Adder; 3.12 Carry-Save Adder; 3.13 Bit-Partitional Adder; 4 Sequential Multiplication; 4.1 Add-and-shift Approach; 4.1 Hardware for Sequential Multiplication; 4.2 Register Occupation; 4.2 Indirect Multiplication Schemes; 4.2. 1 Unsigned Number Multiplication; 4.2.2 Sign-Magnitude Number Multiplication; 4.2.3 One's Complement Number Multiplication
4.3 Unsigned Number Multiplication
Record Nr. UNINA-9910145764203321
Lu Mi  
Hoboken, NJ, : Wiley-Interscience, c2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Arithmetic and logic in computer systems / / Mi Lu
Arithmetic and logic in computer systems / / Mi Lu
Autore Lu Mi
Edizione [1st edition]
Pubbl/distr/stampa Hoboken, NJ, : Wiley-Interscience, c2004
Descrizione fisica 1 online resource (270 p.)
Disciplina 004/.01/51
Collana Wiley Series in Microwave and Optical Engineering
Soggetto topico Computer arithmetic
Logic programming
ISBN 9786610253364
9781280253362
1280253363
9780470357743
0470357746
9780471726210
0471726214
9780471728511
0471728519
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Arithmetic and Logic in Computer Systems; Contents; Preface; List of Figures; List of Figures; List of Tables; List of Tables; About the Author; 1 Computer Number Systems; 1.1 Conventional Radix Number System; 1.2 Conversion of Radix Numbers; 1.3 Representation of Signed Numbers; 1.3.1 Sign-Magnitude; 1.3.2 Diminished Radix Complement; 1.3.3 Radix Complement; 1.4 Signed-Digit Number System; 1.1 Numbers Represented by 4 bits in Different Number Systems; 1.2 Finding Signed Digits; 1.5 Floating-point Number Representation; 1.5.1 Normalization; 1.5.2 Bias; 1.1 Floating-point Representation
1.2 Range of the Numbers1.3 Precision of Floating-Point Numbers; 1.4 Double Precision Floating-Point Representation; 1.3 Reserved Representation in IEEE Standard; 1.6 Residue Number System; 1.7 Logarithmic Number System; References; Problems; 2 Addition and Subtraction; 2.1 Single-Bit Adders; 2.1.1 Logical Devices; 2.1 AOI Function; 2.1 Delay Time and Area of Logic Gates; 2.2 Decoder and Multiplexer; 2.1.2 Single-Bit Half-Adder and Full-Adders; 2.3 Single-Bit Half-Adder; 2.2 Logic Function of a Half-Adder; 2.3 Logic Function of a Full-Adder; 2.4 Design of Full-Adder; 2.2 Negation
2.4 Single-Bit Subtractor2.2.1 Negation in One's Complement System; 2.5 Single-Bit Subtrator; 2.5 Negation in One's Complement System; 2.6 Negation in One's Complement System; 2.2.2 Negation in Two's Complement System; 2.7 Negation in Two's Complement System; 2.3 Subtraction through Addition; 2.8 Subtraction through Addition; 2.9 One-Bit Adder/Subtractor; 2.4 Over flow; 2.5 Ripple Carry Adders; 2.5.1 Two's Complement Addition; 2.10 Two's Complement Addition/Subtraction; 2.5.2 One's Complement Addition; 2.11 One's Complement Addition/Subtraction; 2.5.3 Sign-Magnitude Addition
2.12 Block Diagram of Sign-Magnitude Addition/SubtractionReferences; 2.13 Sign-Magnitude Addition/Subtraction; Problems; 3 High-Speed Adder; 3.1 Conditional-Sum Addition; 3.1 Conditional-Sum Addition; 3.2 Carry-Completion Sensing Addition; 3.2 Conditional-Sum Adder; 3.3 Generation and Transmission of Carries; 3.4 Construction of Carry-Completion Sensing Adder; 3.3 Carry-Lookahead Addition (CLA); 3.3.1 Carry-Lookahead Adder; 3.3.2 Block Carry Lookahead Adder; 3.5 Carry-Lookahead Adder; 3.6 Block Carry-Lookahead Adder; 3.4 Carry-Save Adders (CSA); 3.7 Carry-Save Adder; 3.8 Carry-Save Adder Tree
3.9 Two Types of Parallelization in Multi-Operand Addition3.5 Bit-Partitioned Multiple Addition; 3.1 Maximum Inputs of CSA Trees; 3.10 Bit-Partitioned Multiple Addition; References; Problems; 3.11 Carry-Completion Sensing Adder; 3.12 Carry-Save Adder; 3.13 Bit-Partitional Adder; 4 Sequential Multiplication; 4.1 Add-and-shift Approach; 4.1 Hardware for Sequential Multiplication; 4.2 Register Occupation; 4.2 Indirect Multiplication Schemes; 4.2. 1 Unsigned Number Multiplication; 4.2.2 Sign-Magnitude Number Multiplication; 4.2.3 One's Complement Number Multiplication
4.3 Unsigned Number Multiplication
Record Nr. UNINA-9910817402703321
Lu Mi  
Hoboken, NJ, : Wiley-Interscience, c2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Automata, Logics, and Infinite Games [[electronic resource] ] : A Guide to Current Research / / edited by Erich Grädel, Wolfgang Thomas, Thomas Wilke
Automata, Logics, and Infinite Games [[electronic resource] ] : A Guide to Current Research / / edited by Erich Grädel, Wolfgang Thomas, Thomas Wilke
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (VIII, 392 p.)
Disciplina 004/.01/51
Collana Lecture Notes in Computer Science
Soggetto topico Computers
Computer science
Theory of Computation
Computer Science, general
ISBN 3-540-36387-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ?-Automata -- Infinite Games -- Determinization and Complementation -- Determinization of Büchi-Automata -- Complementation of Büchi Automata Using Alternation -- Determinization and Complementation of Streett Automata -- Parity Games -- Memoryless Determinacy of Parity Games -- Algorithms for Parity Games -- Tree Automata -- Nondeterministic Tree Automata -- Alternating Tree Automata and Parity Games -- Modal ?-Calculus -- Modal ?-Calculus and Alternating Tree Automata -- Strictness of the Modal ?-Calculus Hierarchy -- Monadic Second-Order Logic -- Decidability of S1S and S2S -- The Complexity of Translating Logic to Finite Automata -- Expressive Power of Monadic Second-Order Logic and Modal ?-Calculus -- Tree-like Models -- Prefix-Recognizable Graphs and Monadic Logic -- The Monadic Theory of Tree-like Structures -- Two-Way Tree Automata Solving Pushdown Games -- Guarded Logics -- to Guarded Logics -- Automata for Guarded Fixed Point Logics -- Appendices -- Some Fixed Point Basics.
Record Nr. UNISA-996465276203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Automata, Logics, and Infinite Games : A Guide to Current Research / / edited by Erich Grädel, Wolfgang Thomas, Thomas Wilke
Automata, Logics, and Infinite Games : A Guide to Current Research / / edited by Erich Grädel, Wolfgang Thomas, Thomas Wilke
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (VIII, 392 p.)
Disciplina 004/.01/51
Collana Lecture Notes in Computer Science
Soggetto topico Computers
Computer science
Theory of Computation
Computer Science, general
ISBN 3-540-36387-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ?-Automata -- Infinite Games -- Determinization and Complementation -- Determinization of Büchi-Automata -- Complementation of Büchi Automata Using Alternation -- Determinization and Complementation of Streett Automata -- Parity Games -- Memoryless Determinacy of Parity Games -- Algorithms for Parity Games -- Tree Automata -- Nondeterministic Tree Automata -- Alternating Tree Automata and Parity Games -- Modal ?-Calculus -- Modal ?-Calculus and Alternating Tree Automata -- Strictness of the Modal ?-Calculus Hierarchy -- Monadic Second-Order Logic -- Decidability of S1S and S2S -- The Complexity of Translating Logic to Finite Automata -- Expressive Power of Monadic Second-Order Logic and Modal ?-Calculus -- Tree-like Models -- Prefix-Recognizable Graphs and Monadic Logic -- The Monadic Theory of Tree-like Structures -- Two-Way Tree Automata Solving Pushdown Games -- Guarded Logics -- to Guarded Logics -- Automata for Guarded Fixed Point Logics -- Appendices -- Some Fixed Point Basics.
Record Nr. UNINA-9910143897203321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Concept data analysis [[electronic resource] ] : theory and applications / / Claudio Carpineto, Giovanni Romano
Concept data analysis [[electronic resource] ] : theory and applications / / Claudio Carpineto, Giovanni Romano
Autore Carpineto Claudio
Pubbl/distr/stampa Chichester, England ; ; Hoboken, NJ, : Wiley, c2004
Descrizione fisica 1 online resource (221 p.)
Disciplina 004/.01/51
Altri autori (Persone) RomanoGiovanni
Soggetto topico Computer science - Mathematics
Machine learning
Information retrieval
Soggetto genere / forma Electronic books.
ISBN 1-280-27454-9
9786610274543
0-470-01129-7
0-470-01128-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Concept Data Analysis; Contents; Foreword; Preface; I Theory and Algorithms; 1 Theoretical Foundations; 1.1 Basic Notions of Orders and Lattices; 1.2 Context, Concept, and Concept Lattice; 1.3 Many-valued Contexts; 1.4 Bibliographic Notes; 2 Algorithms; 2.1 Constructing Concept Lattices; 2.1.1 Computational space complexity of concept lattices; 2.1.2 Construction of the set of concepts; 2.1.3 Construction of concept lattices; 2.1.4 Construction of partial concept lattices; 2.2 Incremental Lattice Update; 2.2.1 Incremental construction of concept lattices; 2.2.2 Updating the context
2.2.3 Summary of lattice construction2.3 Visualization; 2.3.1 Hierarchical folders; 2.3.2 Nested line diagrams; 2.3.3 Focus+context views; 2.4 Adding Knowledge to Concept Lattices; 2.4.1 Adding background knowledge to object description; 2.4.2 Pruning concepts with user constraints; 2.5 Bibliographic Notes; II Applications; 3 Information Retrieval; 3.1 Query Modification; 3.1.1 Navigating around the query concept; 3.1.2 Thesaurus-enhanced navigation and querying; 3.1.3 Automatic generation of index terms; 3.2 Document Ranking; 3.2.1 The vocabulary problem; 3.2.2 Concept lattice-based ranking
3.2.3 Scalability3.3 Bibliographic Notes; 4 Text Mining; 4.1 Mining the Content of the ACM Digital Library; 4.1.1 The ACM Digital Library; 4.1.2 Information retrieval and data view versus text mining; 4.1.3 Constructing the TOIS concept lattice; 4.1.4 Interacting with the TOIS concept lattice; 4.2 Mining Web Retrieval Results with CREDO; 4.2.1 Visualizing Web retrieval results; 4.2.2 Design and implementation of CREDO; 4.2.3 Example sessions; 4.3 Bibliographic Notes; 5 Rule Mining; 5.1 Implications; 5.1.1 Computational space complexity of implications
5.1.2 Generating implications from the concept lattice5.2 Functional Dependencies; 5.2.1 Functional dependencies as implications of transformed contexts; 5.2.2 Computational space complexity of the concept lattice of transformed contexts; 5.3 Association Rules; 5.3.1 Mining frequent concepts; 5.3.2 Generating confident rules from frequent concepts; 5.4 Classification Rules; 5.5 Bibliographic Notes; References; Index
Record Nr. UNINA-9910144257003321
Carpineto Claudio  
Chichester, England ; ; Hoboken, NJ, : Wiley, c2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Concept data analysis : theory and applications / / Claudio Carpineto, Giovanni Romano
Concept data analysis : theory and applications / / Claudio Carpineto, Giovanni Romano
Autore Carpineto Claudio
Edizione [1st ed.]
Pubbl/distr/stampa Chichester, England ; ; Hoboken, NJ, : Wiley, c2004
Descrizione fisica 1 online resource (221 p.)
Disciplina 004/.01/51
Altri autori (Persone) RomanoGiovanni
Soggetto topico Computer science - Mathematics
Machine learning
Information retrieval
ISBN 1-280-27454-9
9786610274543
0-470-01129-7
0-470-01128-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Concept Data Analysis; Contents; Foreword; Preface; I Theory and Algorithms; 1 Theoretical Foundations; 1.1 Basic Notions of Orders and Lattices; 1.2 Context, Concept, and Concept Lattice; 1.3 Many-valued Contexts; 1.4 Bibliographic Notes; 2 Algorithms; 2.1 Constructing Concept Lattices; 2.1.1 Computational space complexity of concept lattices; 2.1.2 Construction of the set of concepts; 2.1.3 Construction of concept lattices; 2.1.4 Construction of partial concept lattices; 2.2 Incremental Lattice Update; 2.2.1 Incremental construction of concept lattices; 2.2.2 Updating the context
2.2.3 Summary of lattice construction2.3 Visualization; 2.3.1 Hierarchical folders; 2.3.2 Nested line diagrams; 2.3.3 Focus+context views; 2.4 Adding Knowledge to Concept Lattices; 2.4.1 Adding background knowledge to object description; 2.4.2 Pruning concepts with user constraints; 2.5 Bibliographic Notes; II Applications; 3 Information Retrieval; 3.1 Query Modification; 3.1.1 Navigating around the query concept; 3.1.2 Thesaurus-enhanced navigation and querying; 3.1.3 Automatic generation of index terms; 3.2 Document Ranking; 3.2.1 The vocabulary problem; 3.2.2 Concept lattice-based ranking
3.2.3 Scalability3.3 Bibliographic Notes; 4 Text Mining; 4.1 Mining the Content of the ACM Digital Library; 4.1.1 The ACM Digital Library; 4.1.2 Information retrieval and data view versus text mining; 4.1.3 Constructing the TOIS concept lattice; 4.1.4 Interacting with the TOIS concept lattice; 4.2 Mining Web Retrieval Results with CREDO; 4.2.1 Visualizing Web retrieval results; 4.2.2 Design and implementation of CREDO; 4.2.3 Example sessions; 4.3 Bibliographic Notes; 5 Rule Mining; 5.1 Implications; 5.1.1 Computational space complexity of implications
5.1.2 Generating implications from the concept lattice5.2 Functional Dependencies; 5.2.1 Functional dependencies as implications of transformed contexts; 5.2.2 Computational space complexity of the concept lattice of transformed contexts; 5.3 Association Rules; 5.3.1 Mining frequent concepts; 5.3.2 Generating confident rules from frequent concepts; 5.4 Classification Rules; 5.5 Bibliographic Notes; References; Index
Record Nr. UNINA-9910813257203321
Carpineto Claudio  
Chichester, England ; ; Hoboken, NJ, : Wiley, c2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The definitive guide to how computers do math [[electronic resource] ] : featuring the virtual DIY calculator / / Clive "Max" Maxfield, Alvin Brown
The definitive guide to how computers do math [[electronic resource] ] : featuring the virtual DIY calculator / / Clive "Max" Maxfield, Alvin Brown
Autore Maxfield Clive <1957->
Pubbl/distr/stampa Hoboken, N.J., : Wiley-Interscience, c2005
Descrizione fisica 1 online resource (469 p.)
Disciplina 004.0151
004/.01/51
Altri autori (Persone) BrownAlvin <1954->
Soggetto topico Computer science - Mathematics
Soggetto genere / forma Electronic books.
ISBN 1-280-23573-X
9786610235735
0-470-36237-5
0-471-74196-5
0-471-74197-3
Classificazione 54.00
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto How Computers Do Math; Contents; Laboratories; Do You Speak Martian?; Chapter 0 Why This Book Is So Cool; Chapter 1 Introducing Binary and Hexadecimal Numbers; Chapter 2 Computers and Calculators; Chapter 3 Subroutines and Other Stuff; Chapter 4 Integer Arithmetic; Chapter 5 Creating an Integer Calculator; Chapter 6 More Functions and Experiments; Interactive Laboratories; Appendix A Installing Your DIY Calculator; Appendix B Addressing Modes; Appendix C Instruction Set Summary; Appendix D Additional Resources; About the Authors; Acknowledgments; Index
Record Nr. UNINA-9910144256803321
Maxfield Clive <1957->  
Hoboken, N.J., : Wiley-Interscience, c2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The definitive guide to how computers do math [[electronic resource] ] : featuring the virtual DIY calculator / / Clive "Max" Maxfield, Alvin Brown
The definitive guide to how computers do math [[electronic resource] ] : featuring the virtual DIY calculator / / Clive "Max" Maxfield, Alvin Brown
Autore Maxfield Clive <1957->
Pubbl/distr/stampa Hoboken, N.J., : Wiley-Interscience, c2005
Descrizione fisica 1 online resource (469 p.)
Disciplina 004.0151
004/.01/51
Altri autori (Persone) BrownAlvin <1954->
Soggetto topico Computer science - Mathematics
ISBN 1-280-23573-X
9786610235735
0-470-36237-5
0-471-74196-5
0-471-74197-3
Classificazione 54.00
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto How Computers Do Math; Contents; Laboratories; Do You Speak Martian?; Chapter 0 Why This Book Is So Cool; Chapter 1 Introducing Binary and Hexadecimal Numbers; Chapter 2 Computers and Calculators; Chapter 3 Subroutines and Other Stuff; Chapter 4 Integer Arithmetic; Chapter 5 Creating an Integer Calculator; Chapter 6 More Functions and Experiments; Interactive Laboratories; Appendix A Installing Your DIY Calculator; Appendix B Addressing Modes; Appendix C Instruction Set Summary; Appendix D Additional Resources; About the Authors; Acknowledgments; Index
Record Nr. UNINA-9910830765403321
Maxfield Clive <1957->  
Hoboken, N.J., : Wiley-Interscience, c2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui