الصفحة 1
الصفحة 1
Nearest Neighbor Search : A Database Perspective
Modern applications are both data and computationally intensive and require the storage and manipulation of voluminous traditional (alphanumeric) and nontraditional data sets (images, text, geometric objects, time-series). Examples of such emerging application domains are: Geographical Information Systems (GIS), Multimedia Information Systems, CAD/CAM, Time-Series Analysis, Medical Information Sstems, On-Line Analytical Processing (OLAP), and Data Mining. These applications pose diverse requirements with respect to the information and the operations that need to be supported. From the database perspective, new techniques and tools therefore need to be developed towards increased processing efficiency. This monograph explores the way spatial database management systems aim at supporting queries that involve the space characteristics of the underlying data, and discusses query processing techniques for nearest neighbor queries. It provides both basic concepts and state-of-the-art results in spatial databases and parallel processing research, and studies numerous applications of nearest neighbor queries.
Motion in Games ; 1st International Workshop, MIG 2008, Utrecht, The Netherlands, June 14-17, 2008. Revised Papers
This book constitutes the thoroughly refereed post-workshop proceedings of the First International Workshop on Motion in Games, held in Utrecht, The Netherlands, during June 14-17, 2008, in collaboration with the NLGD Festival of Games.The 24 revised papers presented during the workshop cover topics on crowd simulation; virtual humans; motion synthesis; interfaces; navigation and steering; and facial and behavioral animation.
Morphological Models of Random Structures
This book covers methods of Mathematical Morphology to model and simulate random sets and functions (scalar and multivariate). The introduced models concern many physical situations in heterogeneous media, where a probabilistic approach is required, like fracture statistics of materials, scaling up of permeability in porous media, electron microscopy images (including multispectral images), rough surfaces, multi-component composites, biological tissues, textures for image coding and synthesis. The common feature of these random structures is their domain of definition in n dimensions, requiring more general models than standard Stochastic Processes.The main topics of the book cover an introduction to the theory of random sets, random space tessellations, Boolean random sets and functions, space-time random sets and functions (Dead Leaves, Sequential Alternate models, Reaction-Diffusion), prediction of effective properties of random media, and probabilistic fracture theories.
Modular Algorithms in Symbolic Summation and Symbolic Integration
Brings together two streams in computer algebra: symbolic integration and summation on the one hand, and fast algorithmics on the other hand. In many algorithmically oriented areas of computer science, the analysis of al gorithms placed into the lime light by DonKnuth’stalkat the 1970ICM –provides a crystal-clear criterion for success. The researcher who designs an algorithm that is faster (asymptotically, in the worst case) than any previous method receives instant gratification : her result will be recognized as valuable. Al as, the downside is that such results come along quite infrequently, despite our best efforts. An alternative evaluation method is to run a new algorithm on examples; this has its obvious problems, but is sometimes the best we can do. George Collins, one of the fathers of computer algebra and a great experimenter,wrote in 1969: “I think this demonstrates again that a simple analysis is often more revealing than a ream of empirical data (although both are important). ” Within computer algebra, some areas have traditionally followed the former methodology, notably some parts of polynomial algebra and linear algebra. Other areas, such as polynomial system solving, have not yet been amenable to this - proach. The usual “input size” parameters of computer science seem inadequate, and although some natural “geometric” parameters have been identified (solution dimension, regularity), not all (potential) major progress can be expressed in this framework. Symbolic integration and summation have been in a similar state.
Mathematics of Surfaces XII ; 12th IMA International Conference, Sheffield, UK, September 4-6, 2007, Proceedings
This book constitutes the refereed proceedings of the 12th IMA International Conference on the Mathematics of Surfaces, held in Sheffield, UK in September 2007. The papers cover a range of ideas from underlying theoretical tools to industrial uses of surfaces.
Mathematics of Surfaces XI ; 11th IMA International Conference, Loughborough, UK, September 5-7, 2005, Proceedings
Constitutes the refereed proceedings of the 11th IMA International Conference on the Mathematics of Surfaces, held in Loughborough, UK in September 2005. Among the topics addressed are Voronoi diagrams, linear systems, curvatures on meshes, approximate parameterization, condition numbers, pythagorean hodographs, and more.
Mathematical Morphology : 40 Years On ; Proceedings of the 7th International Symposium on Mathematical Morphology, April 18-20, 2005
Mathematical Morphology is a speciality in Image Processing and Analysis, which considers images as geometrical objects, to be analyzed through their interactions with other geometrical objects. It relies on several branches of mathematics, such as discrete geometry, topology, lattice theory, partial differential equations, integral geometry and geometrical probability. It has produced fast and efficient algorithms for computer analysis of images, and has found applications in bio-medical imaging, materials science, geoscience, remote sensing, quality control, document processing and data analysis. This book contains the 43 papers presented at the 7th International Symposium on Mathematical Morphology, held in Paris on April 18-20, 2005. It gives a lively state of the art of current research topics in this field. It also marks a milestone, the 40 years of uninterrupted development of this ever-expanding domain.
Introduction to Geometric Computing
The geometric ideas in computer science, mathematics, engineering, and physics have considerable overlap and students in each of these disciplines will eventually encounter geometric computing problems. The topic is traditionally taught in mathematics departments via geometry courses, and in computer science through computer graphics modules. This text isolates the fundamental topics affecting these disciplines and lies at the intersection of classical geometry and modern computing.
Interactive Curve Modeling : With Applications to Computer Graphics, Vision and Image Processing
Interactive curve modeling techniques and their applications are extremely useful in a number of academic and industrial settings, and specifically play a significant role in multidisciplinary problem solving, such as in font design, designing objects, CAD/CAM, medical operations, scientific data visualization, virtual reality, character recognition, and object recognition, etc. Various problems such as iris, fingerprint, and signature recognition, can also be intelligently solved and automated using curve techniques.
Integrated Graphic and Computer Modelling
Full colour throughout, the book explores programming language developments from machine code to more natural language forms, and the basic display operations and commands needed to create effective computer graphic systems. As the visual presentation of real and virtual environments becomes more and more the norm in application systems, a clear understanding of the theory that underpins these techniques is required of all students and practitioners studying and working on large computer systems.
Integer programming and combinatorial optimization ; 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings
This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.
Integer programming and combinatorial optimization ; 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings
The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26–28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The frst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990.
Integer programming and combinatorial optimization ; 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings
Constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007. This book presents 36 revised full papers that were reviewed and selected from over 120 submissions.
Integer Programming and Combinatorial Optimization ; 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
Since its start in 1990, the IPCO conference series (held under the auspices of theMathematicalProgrammingSociety)hasbecomeanimportantforumforthe presentation of recent results in Integer Programming and Combinatorial Op- mization. This volume compiles the papers presented at IPCO XI, the eleventh conference in this series, held June 8–10, 2005, at the Technische Universit¨ at Berlin. The high interest in this conference series is evident in the large number of submissions. For IPCO XI, 119 extended abstracts of up to 10 pages were submitted. During its meeting on January 29–30, 2005, the Program Committee carefully selected 34 contributions for presentation in non-parallel sessions at the conference. The ?nal choices were not easy at all, since, due to the limited number of time slots, many very good papers could not be accepted. During the selection process the contributions were refereed according to the standards of refereed conferences. As a result of this procedure, you have in your hands a volume that contains papers describing high-quality research e?orts. The page limit for contributions to this proceedings volume was set to 15. You may ?nd full versions of the papers in scienti?c journals in the near future. We thank all the authors who submitted papers. Furthermore, the Program Committee is indebted to the many reviewers who, with their speci?c expertise, helped a lot in making the decisions.
Hypercomputation : Computing Beyond the Church-Turing Barrier
Hypercomputation is a relatively new theory of computation which treats computing methods and devices that transcend the Church-Turing thesis. This book will provide a thorough description of the field of hypercomputation, covering all attempts at devising conceptual hypermachines and all new promising computational paradigms that may eventually lead to the construction of a hypermachine.Readers will reach a deeper understanding of what computability is and why the Church-Turing thesis poses an arbitrary limit to what actually can be computed. Hypercomputing is quite a novel idea, and therefore the book is interesting to the reader in its own right.
Heterogeneous Objects Modelling and Applications : Collection of Papers on Foundations and Practice
Heterogeneous object modelling is a new and quickly developing research area. This book is one of the first attempts to systematically cover the most relevant themes and problems of this new and challenging subject area. It is a collection of invited papers and papers co-authored by the editors. Each chapter presents either new research results or a survey on the following topics:Formal models and abstractions of heterogeneous objects including geometric, topological, discrete and continuous models, operations forming special algebras and conversions between different model types.
Hardy Inequalities on Homogeneous Groups : 100 Years of Hardy Inequalities
This book provides an extensive treatment of Hardy inequalities and closely related topics from the point of view of Folland and Stein's homogeneous (Lie) groups. The place where Hardy inequalities and homogeneous groups meet is a beautiful area of mathematics with links to many other subjects.In this environment, the theory of Hardy inequalities becomes intricately intertwined with the properties of sub-Laplacians and subelliptic partial differential equations.
Handbook of Mathematical Models in Computer Vision
In this edited volume we present the most prominent mathematical models that are considered in computational vision. To this end, tasks of increasing complexity are considered and we present the state-of-the-art methods to cope with such tasks. The volume consists of six thematic areas that provide answers to the most dominant questions of computational vision: Image reconstruction, Segmentation and object extraction, Shape modeling and registration, Motion analysis and tracking, 3D from images, geometry and reconstruction Applications in medical image analysis
Handbook of Geometric Computing : Applications in Pattern Recognition, Computer Vision, Neuralcomputing, and Robotics
Many computer scientists, engineers, applied mathematicians, and physicists use geometry theory and geometric computing methods in the design of perception-action systems, intelligent autonomous systems, and man-machine interfaces. This handbook brings together the most recent advances in the application of geometric computing for building such systems, with contributions from leading experts in the important fields of neuroscience, neural networks, image processing, pattern recognition, computer vision, uncertainty in geometric computations, conformal computational geometry, computer graphics and visualization, medical imagery, geometry and robotics, and reaching and motion planning. For the first time, the various methods are presented in a comprehensive, unified manner.
Graph-theoretic concepts in computer science ; Vol. 3787 ; 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers
that aims to unite theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science. This book provides results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields.
