تحسين النتائح
ترتيب حسب
من
الى
الصفحة 52
الصفحة 52
Algorithms in Invariant Theory
The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions.
Algorithms in Bioinformatics ; 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting.
Algorithms for Sensor and Ad Hoc Networks : Advanced Lectures
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors, are deployed in some terrain or other. After activation the sensors form a self-organized network and provide data, for example about a forthcoming earthquake. The trend towards wireless communication increasingly affects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor or ad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers in many fields: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry.
Algorithms for a New World : When Big Data and Mathematical Models Meet
Algorithms, artificial neural networks, and machine learning help us discover the opportunities and pitfalls of a world governed by mathematics and artificial intelligence.
Algorithms and Programming : Problems and Solutions
This book containing classical and well-known problems supplemented by clear and in-depth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms and much more.
Algorithms and Models for the Web-Graph ; 4th International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers
his book constitutes the revised papers of the Fourth International Workshop on Algorithms and Models for the Web-Graph, WAW 2006, held in Banff, Canada, November 30 - December 1, 2006.
Algorithms and data structures : The Basic Toolbox
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language.
Algorithms – ESA 2007 ; 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings
This book presented submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applicat.
Algorithms – ESA 2005 ; 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
This volume contains the 75 contributed papers and the abstracts of the threeinvited lectures presented at the 13th Annual European Symposium on Algo-rithms (ESA 2005), held in Spain, 2005. respectively.Papers were solicited in all areas of algorithmic research, including but notlimited to algorithmic aspects of networks, approximation and on-line algo-rithms, computational biology, computational geometry, computational financeand algorithmic game theory, data structures, database and information re-trieval, external memory algorithms, graph algorithms, graph drawing, machinelearning, mobile computing, pattern matching and data compression, quantumcomputing, and randomized algorithms. The algorithms could be sequential,distributed, or parallel. Submissions were especially encouraged in the area ofmathematical programming and operations research, including combinatorialoptimization, integer programming, polyhedral combinatorics, and semidefiniteprogramming.Each extended abstract was submitted to one of the two tracks.
Algorithmic methods for railway optimization ; International Dagstuhl workshop, railway optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers
This state-of-the-art survey features papers that were selected after an open call following the International Dagstuhl Seminar on Algorithmic Methods for Railway Optimization. The second part of the volume constitutes the refereed proceedings of the 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways.
Algorithmic learning theory ; Vol. 3734 ; 16th international conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings
This volume contains the papers presented at the 16th Annual InternationalConference on Algorithmic Learning Theory (ALT 2005), which was held (Republic of Singapore), 2005. The main objective of theconference is to provide an interdisciplinary forum for the discussion of the the-oretical foundations of machine learning as well as their relevance to practicalapplications. The volume includes 30 technical contributions, which were selected by theprogram committee from 98 submissions.
Algorithmic learning theory ; 18th International conference, ALT 2007, Sendai, Japan, October 1-4, 2007, Proceedings
This volume contains the papers presented at the 18th International Conf- ence on Algorithmic Learning Theory.The main objective of the conference was to provide an interdisciplinary forum for high-quality talks with a strong theore- cal background and scientiبهc interchange in areas such as query models, on-line learning, inductive inference, algorithmic forecasting, boosting, support vector machines, kernel methods, complexity and learning, reinforcement learning, - supervised learning and grammatical inference.
Algorithmic Learning in a Random World
This new monograph integrates mathematical theory and revealing experimental work. It demonstrates mathematically the validity of the reliability claimed by conformal predictors when they are applied to independent and identically distributed data, and it confirms experimentally that the accuracy is sufficient for many practical problems. Later chapters generalize these results to models called repetitive structures, which originate in the algorithmic theory of randomness and statistical physics. The approach is flexible enough to incorporate most existing methods of machine learning, including newer methods such as boosting and support vector machines and older methods such as nearest neighbors and the bootstrap.
Algorithmic Aspects of Bioinformatics
Advances in bioinformatics and systems biology require improved computational methods for analyzing data, while progress in molecular biology is in turn influencing the development of computer science methods. This book introduces some key problems in bioinformatics, discusses the models used to formally describe these problems, and analyzes the algorithmic approaches used to solve them. After introducing the basics of molecular biology and algorithmics, Part I explains string algorithms and alignments; Part II details the field of physical mapping and DNA sequencing; and Part III examines the application of algorithmics to the analysis of biological data. Exciting application examples include predicting the spatial structure of proteins, and computing haplotypes from genotype data. This book describes topics in detail and presents formal models in a mathematically precise, yet intuitive manner, with many figures and chapter summaries, detailed derivations, and examples. It is well suited as an introduction into the field of bioinformatics, and will benefit students and lecturers in bioinformatics and algorithmics, while also offering practitioners an update on current research topics.
Algorithmes dapproximation
Le champ des algorithmes d'approximation est aujourd'hui l'un des domaines de recherche les plus actifs en informatique. Il allie la profondeur de la théorie mathématique aux promesses d'applications pratiques d'un intérêt considérable. La plupart des problèmes issus d'applications relevant de domaines aussi différents que la conception de circuits VLSI, la conception et la planification de réseaux, l'ordonnancement, la théorie des jeux, la biologie ou la théorie des nombres, sont des problèmes NP-difficiles. Leur résolution exacte demanderait des ressources informatiques inaccessibles et ne peut donc être envisagée. Pour faire face à cette situation, un grand nombre d'algorithmes proposant des solutions approchées à ces problèmes ont été développés.
Algebraic Methodology and Software Technology ; 12th International Conference, AMAST 2008 Urbana, IL, USA, July 28-31, 2008 Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on Algebraic Methodology and Software Technology, AMAST 2008, held in Urbana, IL, USA, in July 2008.
Algebraic Aspects of the Advanced Encryption Standard
The Belgian block cipher Rijndael was chosen in 2000 by the U.S. government’s National Institute of Standards and Technology (NIST) to be the successor to the Data Encryption Standard. Rijndael was subsequently standardized as the Advanced Encryption Standard (AES), which is potentially the world’s most important block cipher. In 2002, some new analytical techniques were suggested that may have a dramatic effect on the security of the AES. Existing analytical techniques for block ciphers depend heavily on a statistical approach, whereas these new techniques are algebraic in nature.
Algebra, Meaning, and Computation ; Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday
This Festschrift volume - published to honor Joseph Goguen on his 65th Birthday on June 28, 2006 - includes 32 refereed papers by leading researchers in the different areas spanned by Joseph Goguen's work. The papers address a broad variety of topics from meaning, meta-logic, specification and composition, behavior and formal languages, as well as models, deduction, and computation.The papers were presented at a Symposium in San Diego, California, USA in June 2006.
Ajax Patterns and Best Practices
Ajax is taking us into the next generation of web applications. Ajax has broken the client-server barrier by decoupling the client from the server, but an Ajax application still needs a server to extract content from. The most effective use of Ajax and the server requires an understanding of REST, an architectural style used to define Web services. Ajax Patterns and Best Practices explores dynamic web applications that combine Ajax and REST as a single solution. A major advantage of REST is that, like Ajax, it can be used with today's existing technologies.
Ajax in Oracle JDeveloper
The book covers web search and RSS Feed with Ajax as well as form validation with Ajax frameworks for Java, JSP, JSF, and PHP. It discusses using Ajax in Oracle JDeveloper and is IDE based. JDeveloper has the following advantages over Eclipse IDE.
