Search Results - (((((((kant OR wanting) OR span) OR mantis) OR cantor) OR anne) OR carter) OR granting) algorithms.

Fundamentals of Matrix Analysis with Applications. by Saff, Edward Barry

Table of Contents: “…Fixed-Point Methods -- PART II INTRODUCTION: THE STRUCTURE OF GENERAL SOLUTIONS TO LINEAR ALGEBRAIC EQUATIONS -- Chapter 3 Vector Spaces -- 3.1 General Spaces, Subspaces, and Spans -- 3.2 Linear Dependence -- 3.3 Bases, Dimension, and Rank -- 3.4 Summary -- Chapter 4 Orthogonality -- 4.1 Orthogonal Vectors and the Gram-Schmidt Algorithm -- 4.2 Orthogonal Matrices -- 4.3 Least Squares -- 4.4 Function Spaces…”
Full text (MFA users only)

Media Backends : Digital Infrastructures and Sociotechnical Relations. by Parks, Lisa

Full text (MFA users only)

Computational ecology : graphs, networks and agent-based modeling by Zhang, Wenjun

Table of Contents: “…Trees and planar graphs -- 5. Algorithms of graphs -- 6. Directed graphs -- Part II. …”
Full text (MFA users only)

Effective Amazon Machine Learning. by Perrier, Alexis

Table of Contents: “…Cover; Copyright; Credits; About the Author; About the Reviewer; www.PacktPub.com; Customer Feedback; Table of Contents; Preface; Chapter 1: Introduction to Machine Learning and Predictive Analytics; Introducing Amazon Machine Learning; Machine Learning as a Service; Leveraging full AWS integration; Comparing performances; Engineering data versus model variety; Amazon's expertise and the gradient descent algorithm; Pricing; Understanding predictive analytics; Building the simplest predictive analytics algorithm; Regression versus classification.…”
Full text (MFA users only)

Pattern discovery in biomolecular data : tools, techniques, and applications

Table of Contents: “…Discovering patterns in DNA sequences by the algorithmic significance method / Aleksandar Milosavljevic -- Assembling blocks / Jorja G. …”
Full text (MFA users only)

The Method of Fundamental Solutions. by LI, Zi-Cai

Full text (MFA users only)

Stairs 2006 : Proceedings of the Third Starting AI Researchers' Symposium

Table of Contents: “…A Comparison of Two Machine-Learning Techniques to Focus the Diagnosis TaskArgumentation Semantics for Temporal Defeasible Logic; NEWPAR: An Optimized Feature Selection and Weighting Schema for Category Ranking; Challenges and Solutions for Hierarchical Task Network Planning in E-Learning; Invited Talks; Artificial Intelligence and Unmanned Aerial Vehicles; Writing a Good Grant Proposal; Author Index…”
Full text (MFA users only)

Data and Application Security : Developments and Directions by Thuraisingham, Bhavani M.

Table of Contents: “…Protecting Information when Access is Granted for Collaboration -- Author-?: A Java-Based System For XML Data Protection -- A Fair-Exchange E-Commerce Protocol With Automated Dispute Resolution -- XML Access Control Systems: A Component-Based Approach -- A Configurable Security Architecture Prototype -- Distributed Policies for Data Management -- Making Policies Mobile -- Security Architecture of The Multimedia Mediator -- Simulation And Analysis of Cryptographic Protocols -- Authentic Third-Party Data Publication -- Protecting File Systems Against Corruption Using Checksums -- Web Security and Privacy -- Coordinating Policy for Federated Applications -- Integrating Multilevel Security Policies in Multilevel Federated Database Systems -- Wrappers -- A Mechanism to Support State-Based Authorization in Web Applications -- An Integrated Framework for Database Privacy Protection -- Discovery of Multi-Level Security Policies -- Protecting Deductive Databases from Unauthorized Retrievals -- Confidentiality vs Integrity in Secure Databases -- Extending SQL's Grant Operation to Limit Privileges -- Language Extensions for Programmable Security -- Protecting Privacy from Continuous High-Resolution Satellite Surveillance -- Database Security Integration Using Role-Based Access Control -- User Role-Based Security Model for a Distributed Environment -- WorkFlow Analyzed for Security and Privacy in using Databases -- Identifying Security Holes in OLAP Applications -- Algorithms and Experience in Increasing the Intelligibility and Hygiene of Access Control in Large Organizations -- Database Security 2000 -- Declarative Semantics of Belief Queries in Mls Deductive Databases -- Trust Management in Distributed Databases -- Active Authorization as High-level Control -- Conference Key Agreement Protocol using Oblivious Transfer -- An Integration Model of Role-Based Access Control and Activity-Based Access Control Using Task -- Authorization Model in Object-Oriented Systems -- Panel 2 -- Conference Summary.…”
Full text (MFA users only)

Comorbidity in migraine

Full text (MFA users only)

Slantwise moves : games, literature, and social invention in nineteenth-century America by Guerra, Douglas

Full text (MFA users only)

Principles of data integration by Doan, AnHai

Full text (MFA users only)

Computational number theory : proceedings of the Colloquium on Computational Number Theory held at Kossuth Lajos University, Debrecen (Hungary), September 4-9, 1989

Table of Contents: “…On the solution of the diophantine equation Gn = P(x) with sieve algorithmOn Thue equations associated with certain quartic number fields; KANT -- a tool for computations in algebraic number fields; SIMATH -- a computer algebra system…”
Full text (MFA users only)

Generalized Network Design Problems : Modeling and Optimization. by Pop, Petrică C.

Table of Contents: “…Preface; 1 Introduction; 1.1 Combinatorial optimization and integer programming; 1.2 Complexity theory; 1.3 Heuristic and relaxation methods; 1.4 Generalized network design problems; 2 The Generalized Minimum Spanning Tree Problem (GMSTP); 2.1 Definition and complexity of the GMSTP; 2.2 An exact algorithm for the GMSTP; 2.3 Mathematical models of the GMSTP; 2.3.1 Formulations based on tree properties; 2.3.2 Formulations based on arborescence properties; 2.3.3 Flow based formulations; 2.3.4 A model based on Steiner tree properties; 2.3.5 Local-global formulation of the GMSTP.…”
Full text (MFA users only)

Topographical Tools for Filtering and Segmentation 2 : Flooding and Marker-Based Segmentation on Node- or Edge-weighted Graphs. by Meyer, Fernand

Full text (MFA users only)

Deep Learning with Pytorch Quick Start Guide : Learn to Train and Deploy Neural Network Models in Python. by Julian, David

Full text (MFA users only)

Anaphora Resolution. by Mitkov, Ruslan

Table of Contents: “…4.1 Early work in anaphora resolution4.2 Student; 4.3 Shrdlu; 4.4 Lunar; 4.5 Hobbs's naïve approach; 4.5.1 The algorithm; 4.5.2 Evaluation of Hobbs' s algorithm; 4.6 The BFP algorithm; 4.7 Carter's shallow processing approach; 4.8 Rich and LuperFoy's distributed architecture; 4.9 Carbonell and Brown's multi-strategy approach; 4.10 Other work; 4.11 Summary; Chapter Five: The present: knowledge-poor and corpus-based approaches in the 1990s and beyond; 5.1 Main trends in recent anaphora resolution research; 5.2 Collocation patterns-based approach; 5.3 Lappin and Leass's algorithm; 5.3.1 Overview.…”
Full text (MFA users only)

F♯ for Machine Learning Essentials. by Mukherjee, Sudipta

Full text (MFA users only)

Optical networks and components : fundamentals and advances. Volume II, Advances in optical networks and components by Sahu, Partha Pratim (Writer on optical networks)

Table of Contents: “…3.2.4 Analysis of ILP -- 3.3 Routing -- 3.3.1 Routing Algorithms -- 3.3.1.1 Dijkstra's Algorithm -- 3.3.1.2 Bellman-Ford Algorithm -- 3.3.2 Routing Approaches -- 3.3.2.1 Fixed Routing -- 3.3.2.2 Fixed-Alternate Routing -- 3.3.2.3 Flooding -- 3.3.2.4 Adaptive Routing -- 3.3.2.5 Fault-Tolerant Routing -- 3.3.2.6 Randomized Routing -- 3.4 WA Subproblem (Heuristics) -- 3.4.1 Wavelength Search Algorithm -- 3.4.1.1 Exhaustive Search -- 3.4.1.2 Tabu Search -- 3.4.1.3 Simulated Annealing -- 3.4.1.4 Genetic Algorithms -- 3.4.2 WA Heuristics -- 3.4.2.1 Random WA (R) -- 3.4.2.2 First-Fit (FF) Approach…”
Full text (MFA users only)

Java Deep Learning Projects : Implement 10 Real-World Deep Learning Applications Using Deeplearning4j and Open Source APIs. by Karim, Rezaul

Table of Contents: “…; Artificial Neural Networks; Biological neurons; A brief history of ANNs; How does an ANN learn?; ANNs and the backpropagation algorithm; Forward and backward passes; Weights and biases; Weight optimization; Activation functions.…”
Full text (MFA users only)

Introduction to graph theory by Voloshin, Vitaly I. (Vitaly Ivanovich), 1954-

Table of Contents: “…Trees and Distance; 2.3. Minimum Spanning Tree; 2.4. Bipartite Graphs; Chapter 3Chordal Graphs; 3.1. …”
Full text (MFA users only)