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.
Introduction to algorithms [[electronic resource] /] / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
| Introduction to algorithms [[electronic resource] /] / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein |
| Edizione | [3rd ed.] |
| Pubbl/distr/stampa | Cambridge, Mass., : MIT Press, 2009 |
| Descrizione fisica | 1 online resource (xix, 1293 pages) : illustrations |
| Disciplina | 005.1 |
| Altri autori (Persone) |
CormenThomas H
LeisersonCharles E RivestRonald L SteinClifford |
| Soggetto topico |
Computer programming
Computer algorithms |
| Soggetto genere / forma | Electronic books. |
| ISBN |
9780262270830
9780262533058 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""Contents""; ""Preface""; ""I Foundations""; ""1 The Role of Algorithms in Computing""; ""2 Getting Started""; ""3 Growth of Functions""; ""4 Divide-and-Conquer""; ""5 Probabilistic Analysis and Randomized Algorithms""; ""II Sorting and Order Statistics""; ""6 Heapsort""; ""7 Quicksort""; ""8 Sorting in Linear Time""; ""9 Medians and Order Statistics""; ""III Data Structures""; ""10 Elementary Data Structures""; ""11 Hash Tables""; ""12 Binary Search Trees""; ""13 Red-Black Trees""; ""14 Augmenting Data Structures""; ""IV Advanced Design and Analysis Techniques""; ""15 Dynamic Programming""
""16 Greedy Algorithms""""17 Amortized Analysis""; ""V Advanced Data Structures""; ""18 B-Trees""; ""19 Fibonacci Heaps""; ""20 van Emde Boas Trees""; ""21 Data Structures for Disjoint Sets""; ""VI Graph Algorithms""; ""22 Elementary Graph Algorithms""; ""23 Minimum Spanning Trees""; ""24 Single-Source Shortest Paths""; ""25 All-Pairs Shortest Paths""; ""26 Maximum Flow""; ""VII Selected Topics""; ""27 Multithreaded Algorithms""; ""28 Matrix Operations""; ""29 Linear Programming""; ""30 Polynomials and the FFT""; ""31 Number-Theoretic Algorithms""; ""32 String Matching"" ""33 Computational Geometry""""34 NP-Completeness""; ""35 Approximation Algorithms""; ""VIII Appendix: Mathematical Background""; ""A Summations""; ""B Sets, Etc.""; ""C Counting and Probability""; ""D Matrices""; ""Bibliography""; ""Index"" |
| Record Nr. | UNINA-9910465073003321 |
| Cambridge, Mass., : MIT Press, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Machine Learning: From Theory to Applications [[electronic resource] ] : Cooperative Research at Siemens and MIT / / edited by Stephen J. Hanson, Werner Remmele, Ronald L. Rivest
| Machine Learning: From Theory to Applications [[electronic resource] ] : Cooperative Research at Siemens and MIT / / edited by Stephen J. Hanson, Werner Remmele, Ronald L. Rivest |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (VIII, 276 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Microprocessors Artificial Intelligence Computation by Abstract Devices Processor Architectures |
| ISBN | 3-540-47568-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Strategic directions in machine learning -- Training a 3-node neural network is NP-complete -- Cryptographic limitations on learning Boolean formulae and finite automata -- Inference of finite automata using homing sequences -- Adaptive search by learning from incomplete explanations of failures -- Learning of rules for fault diagnosis in power supply networks -- Cross references are features -- The schema mechanism -- L-ATMS: A tight integration of EBL and the ATMS -- Massively parallel symbolic induction of protein structure/function relationships -- Task decomposition through competition in a modular connectionist architecture: The what and where vision tasks -- Phoneme discrimination using connectionist networks -- Behavior-based learning to control IR oven heating: Preliminary investigations -- Trellis codes, receptive fields, and fault tolerant, self-repairing neural networks. |
| Record Nr. | UNISA-996466077703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Proceedings of the second annual Workshop on Computational Learning Theory
| Proceedings of the second annual Workshop on Computational Learning Theory |
| Autore | Rivest Ronald L |
| Pubbl/distr/stampa | [Place of publication not identified], : Morgan Kaufmann Publishers, 1989 |
| Descrizione fisica | 1 online resource (389 pages) |
| Disciplina | 006.3/1 |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | COLT '89 2nd Workshop on Computational Learning Theory, Santa Cruz, CA, USA - July 31 - August 02, 1989 |
| Record Nr. | UNINA-9910375821103321 |
Rivest Ronald L
|
||
| [Place of publication not identified], : Morgan Kaufmann Publishers, 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Towards Trustworthy Elections [[electronic resource] ] : New Directions in Electronic Voting / / edited by David Chaum, Markus Jakobsson, Ronald L. Rivest, Peter Y. A. Ryan, Josh Benaloh, Miroslaw Kutylowski, Ben Adida
| Towards Trustworthy Elections [[electronic resource] ] : New Directions in Electronic Voting / / edited by David Chaum, Markus Jakobsson, Ronald L. Rivest, Peter Y. A. Ryan, Josh Benaloh, Miroslaw Kutylowski, Ben Adida |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (VIII, 403 p. 60 illus.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Management information systems Computer science Algorithms Computers and civilization Application software Cryptology Computer Communication Networks Management of Computing and Information Systems Algorithm Analysis and Problem Complexity Computers and Society Information Systems Applications (incl. Internet) |
| ISBN |
1-280-38645-2
9786613564375 3-642-12980-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Witness-Voting System -- Coercion-Resistant Electronic Elections -- Receipt-Free K-out-of-L Voting Based on ElGamal Encryption -- A Secure Architecture for Voting Electronically (SAVE) -- A Modular Voting Architecture (“Frog Voting”) -- Unconditionally Secure Electronic Voting -- Electronic Elections: A Balancing Act -- An Implementation of a Mix-Net Based Network Voting Scheme and Its Use in a Private Organization -- The Vector-Ballot Approach for Online Voting Procedures -- On Optical Mark-Sense Scanning -- On Some Incompatible Properties of Voting Schemes -- A Threat Analysis of Prêt à Voter -- Anonymity in Voting Revisited -- Anonymous One-Time Broadcast Using Non-interactive Dining Cryptographer Nets with Applications to Voting -- An Introduction to PunchScan -- Component Based Electronic Voting Systems -- A Verifiable Voting Protocol Based on Farnel -- Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster -- Improving Remote Voting Security with CodeVoting -- A Practical and Secure Coercion-Resistant Scheme for Internet Voting -- Scratch, Click & Vote: E2E Voting over the Internet -- Securing Optical-Scan Voting -- Attacking Paper-Based E2E Voting Systems -- Aperio: High Integrity Elections for Developing Countries. |
| Record Nr. | UNISA-996465947703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||