Search Results - (((((((kant OR dkantis) OR semantic) OR find) OR cantor) OR anne) OR plane) OR hints) algorithms.

Distributed algorithms on graphs : proceedings of the 1st International Workshop on Distributed Algorithms : Ottawa, Canada, August 1985

Table of Contents: “…New upperbounds for decentralized extrema-finding in a ring of processors -- 4. Efficient algorithms for routing information in a multicomputer system -- 5. …”
Full text (MFA users only)

Ideals, Varieties, and Algorithms : an Introduction to Computational Algebraic Geometry and Commutative Algebra by Cox, David, Little, John, O'Shea, Donal

Full text (MFA users only)

Elimination Practice : Software Tools and Applications (With Cd-Rom). by Wang, Dongming

Full text (MFA users only)

Automatic defense against zero-day polymorphic worms in communication networks by Mohammed, Mohssen, 1982-

Full text (MFA users only)

C++ Data Structures and Algorithms : Learn how to write efficient code to build scalable and robust applications in C++. by Anggoro, Wisnu

Table of Contents: “…Chapter 4: Arranging Data Elements Using a Sorting AlgorithmTechnical requirements; Bubble sort; Selection sort; Insertion sort; Merge sort; Quick sort; Counting sort; Radix sort; Summary; QA section; Further reading; Chapter 5: Finding out an Element Using Searching Algorithms; Technical requirements; Linear search; Developing a linear search algorithm; Implementing the linear search algorithm; Binary search; Developing binary search algorithm; Implementing binary search algorithm ; Ternary search; Developing ternary search algorithm; Applying the ternary search algorithm.…”
Full text (MFA users only)

Semantic matchmaking with nonmonotonic description logics by Grimm, Stephan

Table of Contents: “…Nonmonotonic Reasoning in the Semantic WebNonmonotonic Description Logics; Autoepistemic Description Logics; Formal Semantics for Autoepistemic DLs; Reasoning with Epistemic Operators; Circumscriptive Description Logics; Formal Semantics for Circumscriptive DLs; Reasoning with Circumscribed Knowledge Bases; Terminological Defaults; Discussion; A Reasoning Algorithm for Circumscriptive Description Logics; Principle Idea of a Tableaux Extension; Extending DL Tableaux Calculi by Preference Clashes; Restrictions on the Formalism; Deciding Circumscriptive ALCO…”
Full text (MFA users only)

Finding the Forest in the Trees : the Challenge of Combining Diverse Environmental Data. by Staff, National Research Council

Table of Contents: “…""Finding the Forest in the Trees""; ""Copyright""; ""Preface""; ""Acknowledgments""; ""Contents""; ""Executive Summary""; ""SUMMARY OF CONCLUSIONS AND RECOMMENDATIONS""; ""Addressing Barriers Deriving from the Data""; ""Addressing Barriers Deriving from Users' Needs""; ""Addressing Barriers Deriving from Organizational Interactions""; ""Addressing Barriers Deriving from System Considerations""; ""TEN KEYS TO SUCCESS""; ""1 Introduction""; ""METHODOLOGY OF THE STUDY""; ""ORGANIZATION OF THE REPORT""; ""REFERENCES""; ""2 Impact Assessment Project for Drought Early Warning in the Sahel""…”
Full text (MFA users only)

Algorithms for image processing and computer vision by Parker, J. R. (Jim R.), 1955-

Table of Contents: “…Algorithms for Image Processing and Computer Vision; Contents; Preface; Chapter 1 Practical Aspects of a Vision System -- Image Display, Input/Output, and Library Calls; Chapter 2 Edge-Detection Techniques; Chapter 3 Digital Morphology; Chapter 4 Grey-Level Segmentation; Chapter 5 Texture and Color; Chapter 6 Thinning; Chapter 7 Image Restoration; Chapter 8 Classification; Chapter 9 Symbol Recognition; Chapter 10 Content-Based Search -- Finding Images by Example; Chapter 11 High-Performance Computing for Vision and Image Processing; Index.…”
Full text (MFA users only)

Abelian coverings of the complex projective plane branched along configurations of real lines by Hironaka, Eriko, 1962-

Full text (MFA users only)

Pattern Recognition. by Theodoridis, Sergios

Table of Contents: “…Chapter 13 Clustering Algorithms II: Hierarchical AlgorithmsChapter 14 Clustering Algorithms III: Schemes Based on Function Optimization; Chapter 15 Clustering Algorithms IV; Chapter 16 Cluster Validity; Appendix A Hints from Probability and Statistics; Appendix B Linear Algebra Basics; Appendix C Cost Function Optimization; Appendix D Basic Definitions from Linear Systems Theory; Index.…”
Full text (MFA users only)

Graph algorithms and applications 4

Table of Contents: “…Statistical analysis of algorithms: a case study of market-clearing mechanisms in the power industry / Chris Barrett [and others], communicated by Dorothea Wagner. …”
Full text (MFA users only)

Scalable algorithms for contact problems by Dostál, Zdeněk, Kozubek, Tomáš, 1975-, Sadowská, Marie, Vonk, Vít

Full text (MFA users only)

Graph algorithms and applications 3

Full text (MFA users only)

Random Iterative Models by Duflo, Marie

Full text (MFA users only)

Data management in the semantic web

Table of Contents: “…DATA MANAGEMENT IN THE SEMANTIC WEB ; DATA MANAGEMENT IN THE SEMANTIC WEB ; CONTENTS ; PREFACE ; INTERPRETATIONS OF THE WEB OF DATA; Abstract; 1. …”
Full text (MFA users only)

Optimization of Computer Networks : Modeling and Algorithms: a Hands-On Approach. by Pavón Mariño, Pablo

Table of Contents: “…7.1 Introduction -- 7.2 Node Location Problems -- 7.3 Full Topology Design Problems -- 7.4 Multilayer Network Design -- 7.5 Notes and Sources -- 7.6 Exercises -- References -- Part Two: Algorithms -- Chapter 8: Gradient Algorithms in Network Design -- 8.1 Introduction -- 8.2 Convergence Rates -- 8.3 Projected Gradient Methods -- 8.4 Asynchronous and Distributed Algorithm Implementations -- 8.5 Non-Smooth Functions -- 8.6 Stochastic Gradient Methods -- 8.7 Stopping Criteria -- 8.8 Algorithm Design Hints -- 8.9 Notes and Sources -- 8.10 Exercises -- References…”
Full text (MFA users only)

Parsing schemata for practical text analysis by Gómez-Rodríguez, Carlos

Full text (MFA users only)

Polynomial root-finding and polynomiography by Kalantari, Bahman

Table of Contents: “…Approximation of square-roots and their visualizations -- The fundamental theorem of algebra and a special case of Taylor's theorem -- Introduction to the basic family and polynomiography -- Equivalent formulations of the basic family -- Basic family as dynamical system -- Fixed points of the basic family -- Algebraic derivation of the basic family and characterizations -- The truncated basic family and the case of Halley family -- Characterizations of solutions of homogeneous linear recurrence relations -- Generalization of Taylor's theorem and Newton's method -- The multipoint basic family and its order of convergence -- A computational study of the multipoint basic family -- A general determinantal lower bound -- Formulas for approximation of pi based on root-finding algorithms -- Bounds on roots of polynomials and analytic functions -- A geometric optimization and its algebraic offsprings -- Polynomiography : algorithms for visualization of polynomial equations -- Visualization of homogeneous linear recurrence relations -- Applications of polynomiography in art, education, science, and mathematics -- Approximation of square-roots revisited -- Further applications and extensions of the basic family and polynomiography.…”
Full text (MFA users only)

Finding candidate options for investment : from building blocks to composite options and preliminary screening

Full text (MFA users only)

Learning OWL class expressions by Lehmann, Jens, 1982-

Table of Contents: “…Refinement Operator Based OWL Learning Algorithms; OCEL (OWL Class Expression Learner); Redundancy Elimination; Creating a Full Learning Algorithm; ELTL (EL Tree Learner)…”
Full text (MFA users only)