This volume contains the proceedings of the Latin American Theoretical Inf- matics (LATIN) conference that was held in Buenos Aires, Argentina, April 5-8, 2004.
The International Conference on Computational Science (ICCS 2004) held in Krak' ow, Poland, June 6-9, 2004, was a follow-up to the highly successful ICCS 2003 held at two locations, in Melbourne, Australia and St.
Technology is taking us to a world where myriads of heavily networked devices interact with the physical world in multiple ways, and at many levels, from the globalInternetdowntomicroandnanodevices.
Knowledge discovery and data mining have become areas of growing significance because of the recent increasing demand for KDD techniques, including those used in machine learning, databases, statistics, knowledge acquisition, data visualization, and high performance computing.
Euro-Par Conference Series Euro-Par is an annual series of international conferences dedicated to the p- motion and advancement of all aspectsof parallelcomputing.
Thepapersinthisvolumewereselectedforpresentationatthe10thInternational Computing and Combinatorics Conference (COCOON 2004), held on August 17-20, 2004 in Jeju Island, Korea.
The natural mission of Computational Science is to tackle all sorts of human problems and to work out intelligent automata aimed at alleviating the b- den of working out suitable tools for solving complex problems.
Choquet capacities, which provide the weighting mechanism for the Choquet and other fuzzy integrals, model synergistic and antagonistic interactions between variables by assigning value to all subsets rather than individual inputs.
This well-known 2-volume textbook provides senior undergraduate and postgraduate engineers, scientists and applied mathematicians with the specific techniques, and the framework to develop skills in using the techniques in the various branches of computational fluid dynamics.
The study of permutation complexity can be envisioned as a new kind of symbolic dynamics whose basic blocks are ordinal patterns, that is, permutations defined by the order relations among points in the orbits of dynamical systems.
Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages.
During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability.
Crypto 2002, the 22nd Annual Crypto Conference, was sponsored by IACR, the International Association for Cryptologic Research, in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbara.
The proceedings of ECML/PKDD2003 are published in two volumes: the P- ceedings of the 14th European Conference on Machine Learning (LNAI 2837) and the Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (LNAI 2838).
This state-of-the-art survey features topics related to the impact of multicore, manycore, and coprocessor technologies in science and for large-scale applications in an interdisciplinary environment.
This book presents a collection of 36 pieces of scientific work in the areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements.
The denotational and expressive needs in cognitive informatics, computational intelligence, software engineering, and knowledge engineering have led to the development of new forms of mathematics collectively known as denotational mathematics.
The mathematical theory and practice of cryptography and coding underpins the provision of effective security and reliability for data communication, processing, and storage.
