1  20
Next
 ESA (Symposium) (5th : 1997 : Graz, Austria)
 Berlin ; New York : Springer, ©1997.
 Description
 Book — 1 online resource (xi, 513 pages) : illustrations
 Summary

This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997. The 38 revised full papers presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.
 Berlin ; New York : Springer, c2002.
 Description
 Book — xiii, 329 p. : ill. ; 24 cm.
 Summary

 Part I. Introducing Macaulay
 2:
 1. Ideals, Varieties and Macaulay 2 by Bernd Sturmfels.
 2. Projective Geometry and Homological Algebra by David Eisenbud.
 3. Data Types, Functions, and Programming by Daniel R. Grayson and Michael E. Stillman.
 4. Teaching the Geometry of Schemes by Gregory G. Smith and Bernd Sturmfels. Part II. Mathematical Computations:
 5. Monomial Ideals by Serkan Hosten and Gregory G. Smith.
 6. From Enumerative Geometry to Solving Systems of Polynomial Equations by Frank Sottile.
 7. Resolutions and Cohomology over Complete Intersections by Luchezar L. Avramov and Daniel R. Grayson.
 8. Algorithms for the Toric Hilbert Scheme by Stillman, Bernd Sturmfels, and Rekha Thomas.
 9. Sheaf Algorithms Using the Exterior Algebra by Wolfram Decker and David Eisenbud.
 10. Needles in a Haystack: Special Varieties via Small Fields by FrankOlaf Schreyer and Fabio Tonoli. 11.Dmodules and Cohomology of Varieties by Uli Walther.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA564 .C6567 2002  Available 
 Lewis, Brian N.
 London, H.M. Stationery Off., 1970.
 Description
 Book — 23 p. 25 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
JN301 .A33 NO.12  Available 
 Berlin ; London : Springer, 2007.
 Description
 Book — 1 online resource (xxiii, 605 pages) : illustrations Digital: text file.PDF.
 Summary

 Optimum Tracking in Dynamic Environments. Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments. Particle Swarm Optimization in Dynamic Environments. Evolution Strategies in Dynamic Environments. Orthogonal Dynamic Hill Climbing Algorithm: ODHC. Genetic Algorithms with SelfOrganizing Behaviour in Dynamic Environments. Learning and Anticipation in Online Dynamic Optimization. Evolutionary Online Data Mining: An Investigation in a Dynamic Environment. Adaptive Business Intelligence: Three Case Studies. Evolutionary Algorithms for Combinatorial Problems in the Uncertain Environment of the Wireless Sensor Networks. Approximation of Fitness Functions. Individualbased Management of Metamodels for Evolutionary Optimization with Application to ThreeDimensional Blade Optimization. Evolutionary Shape Optimization Using Gaussian Processes. A Study of Techniques to Improve the Efficiency of a MultiObjective Particle Swarm Optimizer. An Evolutionary Multiobjective Adaptive Metamodeling Procedure Using Artificial Neural Networks. Surrogate ModelBased Optimization Framework: A Case Study in Aerospace Design. Handling Noisy Fitness Functions. Hierarchical Evolutionary Algorithms and Noise Compensation via Adaptation. Evolving Multi Rover Systems in Dynamic and Noisy Environments. A Memetic Algorithm Using a TrustRegion DerivativeFree Optimization with Quadratic Modelling for Optimization of Expensive and Noisy Blackbox Functions. Genetic Algorithm to Optimize Fitness Function with Sampling Error and its Application to Financial Optimization Problem. Search for Robust Solutions. Single/Multiobjective Inverse Robust Evolutionary Design Methodology in the Presence of Uncertainty. Evolving the Tradeoffs between ParetoOptimality and Robustness in MultiObjective Evolutionary Algorithms. Evolutionary Robust Design of Analog Filters Using Genetic Programming. Robust Salting Route Optimization Using Evolutionary Algorithms. An Evolutionary Approach For Robust Layout Synthesis of MEMS. A Hybrid Approach Based on Evolutionary Strategies and Interval Arithmetic to Perform Robust Designs. An Evolutionary Approach for Assessing the Degree of Robustness of Solutions to MultiObjective Models. Deterministic Robust Optimal Design Based on Standard Crowding Genetic Algorithm.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 ESA (Symposium) (4th : 1996 : Barcelona, Spain)
 Berlin ; New York : Springer, ©1996.
 Description
 Book — 1 online resource (xii, 566 pages) : illustrations Digital: text file.PDF.
 Summary

 Analysis of Shellsort and related algorithms
 Drawing with colors
 Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
 Preemptive weighted completion time scheduling of parallel jobs
 Approximation algorithms for dynamic storage allocation
 Positive linear programming, parallel approximation and PCP's
 Scheduling jobs with communication delays: Using infeasible solutions for approximation
 Randomization of search trees by subtree size
 Efficient dynamic methodlookup for object oriented languages
 Priority queues: Small, monotone and transdichotomous
 Simulated Annealing and its problems to color graphs
 The capacitated Kcenter problem
 A unified local ratio approximation of nodedeletion problems
 Approximation algorithms for connected dominating sets
 Greedy algorithms for the shortest common superstring that are asymtotically optimal
 On the depth of randomly generated circuits
 The analysis of linear probing hashing with buckets
 Parallel algorithms for partitioning sorted sets and related problems
 Fast generation of random permutations via networks simulation
 On the Parallel Dynamic Dictionary Matching problem: New results with applications
 Parallel algorithms for series parallel graphs
 Parallel complexity of householder QR factorization
 Reporting redblue intersections between two sets of connected line segments
 Matching convex shapes with respect to the symmetric difference
 On minimumarea hulls
 Negativecycle detection algorithms
 A new regular grammar pattern matching algorithm
 LempelZiv index for qgrams
 Computing upper and lower bounds on textile nesting problems
 Online and offline approximation algorithms for vector covering problems
 Competitive analysis of randomized paging algorithms
 Online competitive algorithms for call admission in optical networks
 Racecondition detection in parallel computation with semaphores (extended abstract)
 Efficient wavelength routing on directed fiber trees
 A lower bound for nearly minimal adaptive and hot potato algorithms
 The structure of circular decomposable metrics
 Faster algorithms for subgraph isomorphism of?connected partial?trees
 Planar spanners and approximate shortest path queries among obstacles in the plane
 A new approach to optimal planning of robot motion on a tree with obstacles
 Generalized streets revisited
 Computational aspects of organization theory.
 ESA (Symposium) (3rd : 1995 : Kerkyra, Greece)
 Berlin ; New York : Springer, ©1995.
 Description
 Book — xii, 598 pages : illustrations ; 24 cm.
 Summary

 On mixed connectivity certificates. Truly efficient parallel algorithms: coptimal multisearch for an extension of the BSP model. Optimal parallel shortest paths in small treewidth digraphs. Shared memory simulations with triplelogarithmic delay. Implementing shared memory on multidimensional meshes and on the fattree. Beyond the worstcase bisection bound: Fast sorting and ranking on meshes. Fast deterministic simulation of computations on faulty parallel machines. Average circuit depth and average communication complexity. Packing trees. Sometimes travelling is easy: The master tour problem. Interval graphs with side (and size) constraints. Maximum skewsymmetric flows. Certificates and fast algorithms for biconnectivity in fullydynamic graphs. On the allpairs shortest path algorithm of Moffat and Takaoka. Fully Dynamic Transitive Closure in plane dags with one source and one sink. Planarity for clustered graphs. A geometric approach to betweenness. Efficient computation of the geodesic Voronoi diagram of points in a simple polygon. Linear size binary space partitions for fat objects. Geometric pattern matching in ddimensional space. Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in lineartime. Externalmemory algorithms for processing line segments in geographic information systems. Optimized binary search and text retrieval. On using qgram locations in approximate string matching. Routing with bounded buffers and hotpotato routing in vertexsymmetric networks. Load balancing for response time. Selfsimulation for the Passive Optical Star model. Computing the agreement of trees with bounded degrees. Approximation algorithms for feasible cut and multicut problems. On parallel versus sequential approximation. An efficient and effective approximation algorithm for the Map Labeling Problem. Approximating the bandwidth for asteroidal triplefree graphs. Nearoptimal distributed edge coloring. The centroid of points with approximate weights. 0/1Integer programming: Optimization and Augmentation are equivalent. The online transportation problem. A polyhedral approach to planar augmentation and related problems. Optimal layouts on a chain ATM network. Efficient DynamicResharing "Verifiable Secret Sharing" against mobile adversary. Adaptive Video on Demand. The binomial transform and its application to the analysis of skip lists. An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search. Fast skeleton construction.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Feoktistov, Vitaliy.
 New York : Springer Science+Business Media, ©2006.
 Description
 Book — 1 online resource (xii, 195 pages) : illustrations
 Summary

 Differential Evolution. Neoteric Differential Evolution. Strategies of Search. Exploration and Exploitation. New Performance Measures. Transversal Differential Evolution. On Analogy with Some Other Algorithms. Energetic Selection Principle. On Hybridization of Differential Evolution. Applications. End Notes.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 ISAAC (Symposium) (9th : 1998 : Taejŏnsi, Korea)
 Berlin ; London : Springer, ©1998.
 Description
 Book — 1 online resource (xiii, 478 pages) : illustrations
 Summary

 Invited Presentation. The Discrepancy Method. Implementing Algorithms and Data Structures: An Educational and Research Perspective. Geometry I. L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing. Facility Location on Terrains. Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. Complexity I. Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words. Disjunctions of Horn Theories and Their Cores. Checking Programs Discreetly: Demonstrating ResultCorrectness Efficiently While Concealing It. Graph Drawing. TwoLayer Planarization in Graph Drawing. Computing Orthogonal Drawings in a Variable Embedding Setting. Dynamic Grid Embedding with Few Bends and Changes. OnLine Algorithm and Scheduling. Two New Families of List Update Algorithms. An Optimal Algorithm for OnLine Palletizing at Delivery Industry. OnLine Scheduling of Parallel Jobs with Runtime Restrictions. CAD/CAM and Graphics. Testing the Quality of Manufactured Disks and Cylinders. Casting with Skewed Ejection Direction. Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. Graph Algorithm I. kEdge and 3Vertex Connectivity Augmentation in an Arbitrary Multigraph. Polyhedral Structure of Submodular and Posimodular Systems. Maximizing the number of Connections in Optical Tree Networks. Best Paper Presentation. Selecting the k Largest Elements with Parity Tests. Randomized Algorithm. Randomized KDimensional Binary Search Trees. Randomized O(log log n)Round Leader Election Protocols in Packet Radio Networks. Random Regular Graphs with Edge Faults: Expansion through Cores. Complexity II. A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. Generalized Graph Colorability and Compressibility of Boolean Formulae. On the Complexity of Free Monoid Morphisms. Graph Algorithm II. Characterization of Efficiently Solvable Problems on DistanceHereditary Graphs. Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs. Finding Planar Geometric Automorphisms in Planar Graphs. Combinatorial Problem. New Approach for Speeding Up Enumeration Algorithms. Hamiltonian Decomposition of Recursive Circulants. Convertibility among Grid Filling Curves. Geometry II. Generalized SelfApproaching Curves. The Steiner Tree Problem in ?4geometry Plane. Computational Biology. Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic ContextFree Languages. On the Multiple Gene Duplication Problem. Geometry III. Visibility Queries in Simple Polygons and Applications. Quadtree Decomposition, Steiner Triangulation, and Ray Shooting. Optimality and Integer Programming Formulations of Triangulations in General Dimension. Approximation Algorithm. SpaceEfficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. A Capacitated Vehicle Routing Problem on a Tree. Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. Complexity III. The EdgeDisjoint Paths Problem is NPComplete for Partial kTrees. Inapproximability Results for Guarding Polygons without Holes. The Inapproximability of Non NPhard Optimization Problems. Parallel and Distributed Algorithm. An Efficient NC Algorithm for a Sparse kEdgeConnectivity Certificate. A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution. Optimal Approximate Agreement with Omission Faults.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
10. PC AI. [1987  2001]
 [Phoenix, Ariz.] : Knowledge Technology, c1987c2001.
 Description
 Journal/Periodical — 15 v. : ill. ; 28 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks

Request (opens in new tab) 
Q334 .P32 V.8:NO.5V.9:NO.4  Available 
Q334 .P32 V.7:NO.2V.11:NO.3  Available 
Q334 .P32 V.4:NO.5V.6:NO.6  Available 
Q334 .P32 V.3:NO.1V.4:NO.4  Available 
Q334 .P32 V.1:NO.1V.2:NO.4  Available 
 Alpaydin, Ethem.
 2nd ed.  Cambridge, Mass. : MIT Press, ©2010.
 Description
 Book — 1 online resource (xl, 537 pages) : illustrations.
 Summary

The goal of machine learning is to program computers to use example data or past experience to solve a given problem. Many successful applications of machine learning exist already, including systems that analyze past sales data to predict customer behavior, optimize robot behavior so that a task can be completed using minimum resources, and extract knowledge from bioinformatics data. The second edition of Introduction to Machine Learning is a comprehensive textbook on the subject, covering a broad array of topics not usually included in introductory machine learning texts. In order to present a unified treatment of machine learning problems and solutions, it discusses many methods from different fields, including statistics, pattern recognition, neural networks, artificial intelligence, signal processing, control, and data mining. All learning algorithms are explained so that the student can easily move from the equations in the book to a computer program. The text covers such topics as supervised learning, Bayesian decision theory, parametric methods, multivariate methods, multilayer perceptrons, local models, hidden Markov models, assessing and comparing classification algorithms, and reinforcement learning. New to the second edition are chapters on kernel machines, graphical models, and Bayesian estimation; expanded coverage of statistical tests in a chapter on design and analysis of machine learning experiments; case studies available on the Web (with downloadable results for instructors); and many additional exercises. All chapters have been revised and updated. Introduction to Machine Learning can be used by advanced undergraduates and graduate students who have completed courses in computer programming, probability, calculus, and linear algebra. It will also be of interest to engineers in the field who are concerned with the application of machine learning methods.
(source: Nielsen Book Data)
 Alpaydin, Ethem.
 2nd ed.  Cambridge, Mass. : MIT Press, c2010.
 Description
 Book — 1 online resource (xl, 537 p.) : ill.
 Summary

The goal of machine learning is to program computers to use example data or past experience to solve a given problem. Many successful applications of machine learning exist already, including systems that analyze past sales data to predict customer behavior, optimize robot behavior so that a task can be completed using minimum resources, and extract knowledge from bioinformatics data. The second edition of Introduction to Machine Learning is a comprehensive textbook on the subject, covering a broad array of topics not usually included in introductory machine learning texts. In order to present a unified treatment of machine learning problems and solutions, it discusses many methods from different fields, including statistics, pattern recognition, neural networks, artificial intelligence, signal processing, control, and data mining. All learning algorithms are explained so that the student can easily move from the equations in the book to a computer program. The text covers such topics as supervised learning, Bayesian decision theory, parametric methods, multivariate methods, multilayer perceptrons, local models, hidden Markov models, assessing and comparing classification algorithms, and reinforcement learning. New to the second edition are chapters on kernel machines, graphical models, and Bayesian estimation; expanded coverage of statistical tests in a chapter on design and analysis of machine learning experiments; case studies available on the Web (with downloadable results for instructors); and many additional exercises. All chapters have been revised and updated. Introduction to Machine Learning can be used by advanced undergraduates and graduate students who have completed courses in computer programming, probability, calculus, and linear algebra. It will also be of interest to engineers in the field who are concerned with the application of machine learning methods.
(source: Nielsen Book Data)
13. Graphs, networks, and algorithms [2005]
 Graphen, netzwerke, und algorithmen. English
 Jungnickel, D. (Dieter), 1952
 2nd ed.  Berlin ; New York : Springer, ©2005.
 Description
 Book — 1 online resource (xvi, 611 pages) : illustrations Digital: text file.PDF.
 Summary

 Preface. Basic Graph Theory. Algorithms and Complexity. Shortest Paths. Spanning Trees. The Greedy Algorithm. Flows. Combinatorial Applications. Connectivity and Depth First Search. Colorings. Circulations. The Network Simplex Algorithm. Matchings. Weighted Matchings. A Hard Problem: The TSP. Appendix A: Solutions. Appendix B: List of Symbols. References. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Cox, Earl.
 Amsterdam ; Boston : Elsevier/Morgan Kaufmann, ©2005.
 Description
 Book — 1 online resource (xxi, 530 pages) : illustrations
 Summary

 Foundations and ideas
 Principal model types
 Approaches to model building
 Fundamental concepts of fuzzy logic
 Fundamental concepts of fuzzy systems
 Fuzzy SQL and intelligent queries
 Fuzzy clustering
 Fuzzy rule induction
 Fundamental concepts of genetic algorithms
 Genetic resource scheduling optimization
 Genetic tuning of fuzzy models.
 Berlin : Springer, ©1999.
 Description
 Book — 1 online resource (XIII, 448 pages) : illustrations Digital: text file.PDF.
 Summary

 Invited Talk
 The Engineering of Some Bipartite Matching Programs
 Session 1(a)
 Data Structure I
 General Splay: A Basic Theory and Calculus
 Static Dictionaries Supporting Rank
 Session 1(b)
 Parallel & Distributed Computing I
 Multiple SpinBlock Decisions
 Asynchronous Random Polling Dynamic Load Balancing
 Session 2(a)
 Approximate Algorithm I
 Simple Approximation Algorithms for MAXNAESP and Hypergraph 2colarability
 Hardness of Approximating Independent Domination in Circle Graphs
 ConstantFactor Approximation Algorithms for Domination Problems on Circle Graphs
 Session 2(b)
 Computational Intelligence
 Ordered Binary Decision Diagrams as KnowledgeBases
 Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots
 Session 3(a)
 Online Algorithm
 OnLine Load Balancing of Temporary Tasks Revisited
 Online Routing in Triangulations
 Session 3(b)
 Complexity Theory I
 The Query Complexity of Program Checking by ConstantDepth Circuits
 TreeLike Resolution Is Superpolynomially Slower Than DAGLike Resolution for the Pigeonhole Principle
 Session 4(a)
 Approximate Algorithm II
 Efficient Approximation Algorithms for Multilabel Map Labeling
 Approximation Algorithms in Batch Processing
 Session 4(b)
 Graph Algorithm I
 LexBFSOrdering in Asteroidal TripleFree Graphs
 Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs
 Invited Talk
 Approximation Algorithms for Some Clustering and Classification Problems
 Session 5(a)
 Computational Geometry I
 How Many People Can Hide in a Terrain?
 Carrying Umbrellas: An Online Relocation Problem on Graphs
 Session 5(b)
 Parallel & Distributed Computing II
 Survivable Networks with Bounded Delay: The Edge Failure Case
 EnergyEfficient Initialization Protocols for Adhoc Radio Networks
 Session 6(a)
 Data Structure II
 Constructing the Suffix Tree of a Tree with a Large Alphabet
 An O(1) Time Algorithm for Generating Multiset Permutations
 Session 6(b)
 Complexity Theory II
 Upper Bounds for MaxSat: Further Improved
 A Linear Time Algorithm for Recognizing Regular Boolean Functions
 Session 7(a)
 Computational Geometry II
 Station Layouts in the Presence of Location Constraints
 Reverse Center Location Problem
 Session 7(b)
 Algorithms in Practice
 Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields
 External Memory Algorithms for Outerplanar Graphs
 Session 8(a)
 Approximate Algorithm III
 A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree
 Approximation Algorithms for Channel Assignment with Constraints
 Session 8(b)
 Graph Algorithm II
 Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs
 A Linear Algorithm for Finding Total Colorings of Partial kTrees
 Invited Talk
 TopologyOriented Approach to Robust Geometric Computation
 Session 9(a)
 Approximate Algorithm IV
 Approximating Multicast Congestion
 Approximating the Minimum kway Cut in a Graph via Minimum 3way Cuts
 Session 9(b)
 Parallel & Distributed Computing III
 Online Scheduling of Parallel Communications with Individual Deadlines
 A Faster Algorithm for Finding Disjoint Paths in Grids
 Session 10(a)
 Computational Geometry III
 OutputSensitive Algorithms for Uniform Partitions of Points
 Convexifying Monotone Polygons
 Session 10(b)
 Graph Algorithm III
 Bisecting Two Subsets in 3Connected Graphs
 Generalized Maximum Independent Sets for Trees in Subquadratic Time.
 ISAAC (Symposium) (8th : 1997 : Singapore)
 Berlin ; New York : Springer, ©1997.
 Description
 Book — 1 online resource (xv, 426 pages) : illustrations
 Summary

 Solving NPhard combinatorial problems in the practical sense Invited presentation
 Airline crewscheduling problem with many irregular flights
 Practical approach to a facility location problem for largescale logistics
 Hard instance generation for SAT
 Playing tetris on meshes and multidimensional Shearsort
 Formulation of the additionshiftsequence problem and its complexity
 Weighted and unweighted selection algorithms for k sorted sequences
 An adaptive distributed faulttolerant routing algorithm for the star graph
 Multicolor routing in the undirected hypercube
 Competitive source routing on tori and meshes
 Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs
 Augmenting edge and vertex connectivities simultaneously
 Twoface horn extensions
 Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae
 Algorithmic analysis of multithreaded algorithms
 A characterization of planar graphs by pseudoline arrangements
 Optimal faulttolerant broadcasting in trees
 A theoretical framework of hybrid approaches to MAX SAT
 Exponential lower bounds on the size of OBDDs representing integer division
 Online versus offline in moneymaking strategies with brokerage
 Decisionmaking by hierarchies of discordant agents
 A new efficient offline anonymous cash scheme
 Approximating unweighted connectivity problems in parallel
 A randomized linear work EREW PRAM algorithm to find a minimum spanning forest
 Efficient parallel algorithms for planar stgraphs
 Pegsolitaire, string rewriting systems and finite automata
 On the size of probabilistic formulae
 Homophonic coding with logarithmic memory size
 Complexity and modeling aspects of mesh refinement into quadrilaterals
 Topology oriented vs. exact arithmetic
 Experience in implementing the threedimensional convex hull algorithm
 The complexity of learning branches and strategies from queries
 Singularities make spatial join scheduling hard
 A faster onedimensional topological compaction algorithm
 Algorithms for finding optimal disjoint paths around a rectangle
 An algorithm for finding a region with the minimum total L 1 from prescribed terminals
 On defect sets in bipartite graphs (extended abstract)
 Dynamic programming on distancehereditary graphs
 On the equivalence in complexity among basic problems on bipartite and parity graphs
 Allcavity maximum matchings
 Fast algorithms for computing ?Skeletons and their relatives
 A branchandcut approach for minimum weight triangulation
 An efficient approximation scheme for the subsetsum problem
 Competitive call control in mobile networks
 Generalized swapwithparent schemes for selforganizing sequential linear lists.
 Teillaud, Monique, 1961 Author
 Berlin : SpringerVerlag, 1993.
 Description
 Book — 1 online resource (IX, 156 pages) : illustrations
 Summary

 Fundamental structures
 Static randomized incremental algorithms
 The Delaunay tree
 A general structure: The influence graph
 The kDelaunay tree
 Towards a fully dynamic structure
 Parallel work.
 ALENEX '99 (1999 : Baltimore, Md.)
 Berlin ; New York : Springer, ©1999.
 Description
 Book — 1 online resource (viii, 347 pages) : illustrations
 Summary

 Combinatorial Algorithms
 Efficient Implementation of the WARMUP Algorithm for the Construction of LengthRestricted Prefix Codes
 Implementing Weighted bMatching Algorithms: Insights from a Computational Study
 Designing Practical Efficient Algorithms for Symmetric Multiprocessors
 Circular Drawings of Biconnected Graphs
 Heuristics and Experimental Design for Bigraph Crossing Number Minimization
 Binary Space Parititions in Plücker Space
 Practical PointinPolygon Tests Using CSG Representations of Polygons
 Software and Applications
 Accessing the Internal Organization of Data Structures in the JDSL Library
 ObjectOriented Design of Graph Oriented Data Structures
 A Case Study on the Cost of Geometric Computing
 Design and Implementation of the FiducciaMattheyses Heuristic for VLSI Netlist Partitioning
 Algorithms for Restoration Planning in a Telecommunications Network
 Computing the n × m Shortest Paths Efficiently
 Image Watermarking for Copyright Protection
 Algorithms for NPHard Problems
 A Self Organizing Bin Packing Heuristic
 Finding the Right Cutting Planes for the TSP
 ObstacleAvoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm
 Data Structures
 Adaptive Algorithms for Cacheefficient Trie Search
 Fast Priority Queues for Cached Memory
 Efficient Bulk Operations on Dynamic Rtrees.
 New York : IEEE Press, ©1998.
 Description
 Book — 1 online resource (xiii, 641 pages) : illustrations
 WADS '97 (1997 : Halifax, N.S.)
 Berlin ; New York : Springer, ©1997.
 Description
 Book — 1 online resource (x, 476 pages) : illustrations
 Summary

 Discrepancy theory and computational geometry. Dynamic motion planning in low obstacle density environments. Visibilitybased pursuitevasion in a polygonal environment. Maintaining the extent of a moving point set. Finding cores of limited length. On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem. Approximation algorithms for a genetic diagnostics problem. Cartographic line simplication and polygon CSG formulae in O(n log* n) time. Constrained TSP and lowpower computing. Online load balancing for related machines. A lineartime algorithm for the 1mismatch problem. On some geometric optimization problems in layered manufacturing. New TSP construction heuristics and their relationships to the 2opt. Pattern matching in hypertext. Multiple approximate string matching. Applied computational geometry  Abstract. Checking the convexity of polytopes and the planarity of subdivisions (extended abstract). Voronoi diagrams for polygonoffset distance functions. Randomized algorithms for that ancient scheduling problem. Optimal parallel algorithms for proximate points, with applications. An efficient algorithm for shortest paths in vertical and horizontal segments. On geometric path query problems. Online scheduling with hard deadlines. Load balanced mapping of data structures in parallel memory modules for fast and conflictfree templates access. Parallel vs. parametric complexity. Positionindependent near optimal searching and online recognition in star polygons. Dynamic data structures for fat objects and their applications. Intractability of assembly sequencing: Unit disks in the plane. On hamiltonian triangulations in simple polygons (Extended Abstract). Computing orthogonal drawings with the minimum number of bends. On a simple depthfirst search strategy for exploring unknown graphs. Orthogonal drawing of high degree graphs with small area and few bends. A centroid labelling technique and its application to path selection in trees. Offsetpolygon annulus placement problems. Computing constrained minimumwidth annuli of point sets. Geometric Applications of Posets. Constructing pairwise disjoint paths with few links. Transdichotomous algorithms without multiplication  some upper and lower bounds. An approximation algorithm for stacking up bins from a conveyer onto pallets. Relaxed balance through standard rotations. Efficient breakout routing in printed circuit boards. Planarity, revisited (extended abstract).
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.