161. The Art Of Computer Programming Seminumerical algorithms , Third Edition (Reading, Massachusetts AddisonWesley, The MIX computer will soon be replaced by a RISC machine called MMIX. http://www-cs-faculty.stanford.edu/~knuth/taocp.html

The Art of Computer Programming (TAOCP) by Donald E. Knuth. Click here to send a message to the publisher requesting email updates about current and future volumes of these books. At the end of 1999, these books were named among the best twelve physical-science monographs of the century by American Scientist , along with: Dirac on quantum mechanics, Einstein on relativity, Mandelbrot on fractals, Pauling on the chemical bond, Russell and Whitehead on foundations of mathematics, von Neumann and Morgenstern on game theory, Wiener on cybernetics, Woodward and Hoffmann on orbital symmetry, Feynman on quantum electrodynamics, Smith on the search for structure, and Einstein's collected papers. Wow! Volume 1 Fundamental Algorithms , Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp. ISBN 0-201-89683-4 Fascicle 1 MMIX : A RISC Computer for the New Millenium (2005), v+134pp. ISBN 0-201-85392-2 Translations of previous editions: Romanian translation by Adrian Davidoviciu, Adrian Petrescu, Smaranda Dimitriu, and Paul Zamfirescu, Tratat de programarea calculatoarelor , V. 1:

162. Jeffrey D. Ullman J.D. Ullman He is a famous author of computer science books, on algorithms Discrete Mathematics . http://www-db.stanford.edu/~ullman/

Jeffrey D. Ullman Jeff Ullman is the Stanford W. Ascherman Professor of Computer Science (Emeritus). His interests include database theory, database integration, data mining, and education using the information infrastructure. What's New Polemics Publications Books ... Biographical Information What's New Gradiance I'm a founder of Gradiance Corporation , whose goal is to provide better, cheaper homework and programming-lab support for college courses. Our first offering is support for database courses, but we hope to be covering all of computer science, and more soon. You can get a Tour of Gradiance For academic year 2004-2005, we are making a basic set of database materials available to all users, free of charge. Please contact me (ullman at gmail dot com) if you would like to use the service. New : sets of questions on: Compilers (LR-parsing, code optimization, syntax-directed translation) Automata (regular and context-free languages) Operating Systems are available for free use by instructors. Also contact (ullman at gmail dot com) for access to these materials for your class. New Set of CS345 Materials I taught CS345 in Spring 2003 as a mixture of database theory and data-mining algorithms. The

163. University Of Trier (Trèves) / CS Homepage computer Science Department. Research groups cover stochastic modelling and computer networks, theoretical computer science, programming languages and compilers, databases and information systems, system software and distributed systems algorithms and data structures. http://www.informatik.uni-trier.de/

CS Department, University of Trier deutschsprachige Fassung dieser Seite Student Homepages Troubleshooting Problems accessing our web server? Solutions here! Department News Information for new students (german) Divisions Stochastic Modelling and Computer Networks Prof. Dr. Dieter Baum Theoretical Computer Science and new Applications ... Bernd Walter Information about CS Department CS Studies in Trier Student's Calendar Student Representatives Current Courses and online Scripts ... Colloquium and ongoing Seminar on CS Localization Related fields: Computer Linguistics Mathematics Business Computer Science Specific Activities 6th International Symposium RM03 Internet-Bridge Trier-Beijing Electronic Colloquium on Computational Complexity (ECCC) (WEP) Complexity SIG of the German Society for Computer Science (GI) Software MSDN Academic Alliance (german) NEWS Events June 9, 10, 17, 2005 Vorstellungsvorträge im Rahmen des Berufungsverfahrens W3-Professur Theoretische Informatik February 27, 2004 Abschiedskolloquium Prof. Dr. Dieter Baum ( HZ12 ) January 13, 2004 Prof. Dr. Stephan Waack (Universität Göttingen) -

164. Mathinfo2000 Aims to bring together researchers in theoretical computer science and mathematics. Topics include trees, stochastic processes, large deviations, branching processes, random walks, discrete probability, enumerative and analytical combinatorics, analysis of algorithms, performance evaluation, and combinatorial optimization. Versailles, France, September 1820, 2000. http://www.prism.uvsq.fr/recherche/themes/ANCIENS/teams/complex/confs/mathinfo20

Colloquium on Mathematics and Computer Science : Algorithms, Trees, Combinatorics and Probabilities Call For Papers September 18-20, 2000 45, avenue des Etats-Unis 78035 Versailles cedex - France Scientific Committee Organisation Committee Electronic mail : mathinfo@prism.uvsq.fr Scope of the Colloquium Call For Papers Appel a communications (postscript) Invited papers Sponsors List of accepted papers Scientific program ... Version francaise Important dates : March 15, 2000 : Deadline for submission of papers (10 pages). May 24, 2000 : Decision of the scientific committee June 15, 2000 : Final version of accepted papers Official languages : English and French Registration Accomodation Conference site LAMA

165. Illinois Genetic Algorithms Laboratory IlliGAL studies nature's search algorithm of choice, genetics and evolution, as a practical approach to solving difficult problems on a computer. Research at IlliGAL has concentrated on the development of a design theory for selectorecombinative GAs, their competent design and implementation, GAs using selection and recombination that solve hard problems, quickly, reliably, and accurately, and the analysis and design of efficiency enhancement measures through parallelization, time utilization, hybridization, and evaluation relaxation. http://www-illigal.ge.uiuc.edu/

166. Chryssis Georgiou Department of computer Science, University of Cyprus. Design and Analysis of algorithms; Parallel and Distributed Computing; FaultTolerance; Survivability of Replicated Objects; Dynamic Computing Environments. Publications. http://www.cs.ucy.ac.cy/~chryssis/

Dr. Chryssis Georgiou Lecturer Department of Computer Science University of Cyprus Education University of Connecticut , December 2003 University of Connecticut , May 2002 B.S. in Mathematics, University of Cyprus , June 1998 Courses Fall 2005 : Programming Principles I Spring 2005 : Data Structures and Algorithms : Introduction to Programming (Fortran) Previous Semesters : Synthesis of Parallel Algorithms, Fall 2004 EPL031: Introduction to Programming (Fortran), Spring 2004 Research Interests Design, Analysis, and Implementation of Algorithms Parallel and Distributed Computing Dependability, Survivability, and Fault-Tolerance Dynamic Computing Environments Cooperative and Non-cooperative Computations Publications Journals Chryssis Georgiou, Dariusz R. Kowalski, and Alex A. Shvartsman Efficient Gossip and Robust Distributed Computation, in Theoretical Computer Science ( TCS ), Elsevier, accepted. Chryssis Georgiou, Alexander Russell, and Alex. A. Shvartsman , Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency, in Parallel Processing Letters ( PPL ), World Scientific, accepted.

167. TUM Informatik - Faculty of Informatics. Research groups focus on programming, distributed systems, formal languages, compiler construction, database systems, engineering applications of computer science, numerical methods, real time systems, robotics, theoretical computer science, artificial intelligence, communication, deduction, knowledge based systems, image processing, computer architecture, applied computer science, operating systems, networks, and algorithms. http://www.informatik.tu-muenchen.de/index_en.html

Department of Informatics HOME ACADEMIC RESEARCH FACULTY ... Feedback Welcome to the Department of Informatics! ACADEMIC The lectures of Winter Semester 2005/06 start Monday, 17/10/2005 and finish Saturday, 11/02/2006. This site provides information for all courses programs for gifted students application procedure TUM events: for prospective students ... academic affairs: for prospective students and much more. FACULTY TUM Informatics: Top positions in University rankings of news magazines Focus Spiegel WirtschaftsWoche , and Karriere Campus Garching Address How To Get Here ... Cafeteria in the MI-Building Current Events New Announcements Es sind noch ein paar Plätze frei im 3D Rendering Praktikum: Digital Fishtank Studentische Hilfskraft für die Betreuung von 2 Linux-Rechenclustern gesucht Promotionsthema: Stabilitätsanalyse von Rivulets Mac ProgrammiererInnen gesucht ... ... More ... Search in Announcements Courses Persons Rooms Web-Pages Student in München? Check out studiosity.de

168. CERL Sound Group The CERL Sound Group is an informal research group that undertakes hardware/software development in digital audio signal processing and computer music. Current research areas include realtime algorithms, sinusoidal modeling, user interface hardware/software for music performance, airflow, and music notation. http://www.cerlsoundgroup.org/

169. R. Mukundan | People | CSSE | UC University of Canterbury. Image Analysis computer Vision, Pattern Recognition, Moment functions, Biometrics. computer Graphics Graphics algorithms, Visualization, Virtual Reality, Image Based Rendering. Publications and Java applets. http://www.cosc.canterbury.ac.nz/people/mukundan/

UC Home Courses Departments Library ... People About CSSE Department Contacts People Courses ... Help! R. Mukundan M.Sc., Ph.D. Senior Lecturer Office: Phone: +64 (03) 364 2987 ext 7770 Internal: Fax: Email: mukund@cosc.canterbury.ac.nz Postal address: Department of Computer Science and Software Engineering, University of Canterbury, Private Bag 4800, Christchurch, New Zealand Research Computer Vision: Pose estimation using moment functions Object recognition using moment invariants Moment based algorithms for stereo vision Image Analysis: Discrete orthogonal image transforms Image compression using Tchebichef transform Invariant characteristics of shape descriptors Fast computation of moment invariants Computer Graphics: Real-time rendering Non-photorealistic rendering Terrain rendering algorithms Image-based rendering and view synthesis List of publications. Recent publications with full text. Recent seminars. Java Applets for Algorithm Visualization Jave Applets Centre Computer Graphics Computer Vision Computational Geometry ... Models of Computation Courses COSC422: Advanced Computer Graphics COSC363: Computer Graphics COSC229: Algorithms COSC230: Programming Languages ... COSC222: Models of Computation Last modified: Monday, 14-Jun-2004 18:23:08 NZST

170. - Weiterleitung - Department of computer Information Science. Research topics include VLSI, algorithms for planar networks, discrete algorithms, software engineering, network design, railroad applications, graph visualization, and optimization in object databases. http://www.inf.uni-konstanz.de/index.html.en

Bitte folgen Sie dem Link, falls sie nicht automatisch weitergeleitet werden: http://www.inf.uni-konstanz.de

171. GAP System For Computational Discrete Algebra School of computer Science. The home of GAP, a free system for discrete computational algebra, available for FTP download. http://www-gap.dcs.st-and.ac.uk/

@import url(lib/gw.css); GAP Main Branches Download Overview Data Libraries Packages ... Sitemap Navigation Tree Start Download Overview Data Libraries ... GAP 3 Quicklinks Site Structure Search Web Site Capabilities Manuals ... References Welcome to GAP - Groups, Algorithms, Programming - a System for Computational Discrete Algebra What is GAP? GAP is a system for computational discrete algebra, with particular emphasis on Computational Group Theory . GAP provides a programming language , a library of thousands of functions implementing algebraic algorithms written in the GAP language as well as large data libraries of algebraic objects. See also the overview and the description of the mathematical capabilities . GAP is used in research and teaching for studying groups and their representations, rings, vector spaces, algebras, combinatorial structures, and more. The system, including source, is distributed freely . You can study and easily modify or extend it for your special use. The current release is GAP 4r4.6. The pages of this web site describe this release if not stated otherwise. A section of the Preface of the Manual informs about

172. Redirection Automatique 4th International Workshop on Approximation algorithms for Combinatorial Optimization Problems (APPROX 2001) and 5th International Workshop on Randomization and Approximation Techniques in computer Science (RANDOM 2001). Berkeley, California; August 1820, 2001. http://cui.unige.ch/tcs/random-approx/

Redirection automatique vers la page actuelle. Si votre navigateur ne supporte pas la redirection automatique, vous pouvez suivre ce lien: [lien vers le cours]

173. Improving Computer Control Of Batch Dyeing Operations Presentation of novel control algorithms, and specific simulation and experimental results for fuzzy logic and adaptive control systems in textile dye houses. Authors Brent Smith and Jun Lu. http://www.p2pays.org/ref/03/02348.pdf

174. INI Programme CMP Research programme at the Isaac Newton Institute, Cambridge UK. Themes include Randomised algorithms; Phase transitions in statistical physics and computer science; Random graphs and structures. August December 2002. http://www.newton.cam.ac.uk/programs/CMP/cmp.html

@import url(/css/prog-non_n4.css); Institute Home Page Programmes Web-Seminars Programme Home Seminars Workshops Participants Long Stay Short Stay Additional Links Contacts Mailing List Background Isaac Newton Institute for Mathematical Sciences Computation, Combinatorics and Probability 29 Jul - 20 Dec 2002 Organisers : Professor Martin Dyer ( Leeds ), Professor Mark Jerrum ( Edinburgh ), Dr Peter Winkler ( Bell Labs Programme theme As Computer Science has matured as a discipline, its relationships with mathematics have become both more wide ranging and more profound. The programme will explore two particularly fruitful interfaces between computer science and mathematics, namely those with combinatorics and probability theory. Although no interdisciplinary work within the broad area delineated by the title will be excluded, the following themes will receive special emphasis. Randomised algorithms. The design and analysis of algorithms that make random choices; also deterministic algorithms when run on random instances.The theoretical basis here includes the study of parameters connected with random walks on graphs and the relationships between them. "Phase transitions" in statistical physics and computer science.

175. Institut Für Computergraphik Und Algorithmen Welcome to The Institute of computer Graphics and algorithms at the computer Science Department of the Vienna University of Technology. http://www.cg.tuwien.ac.at/

Institute of Computer Graphics and Algorithms Welcome to The Institute of Computer Graphics and Algorithms at the Computer Science Department of the Vienna University of Technology The Institute consists of two groups: Algorithms and Data Structures Group (Prof. Mutzel) Computer Graphics Group (Prof. Purgathofer) We encourage the activity against software patents in europe. Read more on this link! Home Last update by Webmaster on 10. Jul 02 Comments to webmaster#cg.tuwien.ac.at Favoritenstrasse 9-11 / E186, A-1040 Wien, Austria Tel. +43 (1) 58801-18601, Fax +43 (1) 58801-18699 www.cg.tuwien.ac.at

176. Introduction To Fortran 90/95, Algorithms, And Structured Programming By R. A. Vowels. Emphasizes fundamentals of structured programming through study of Fortran 90/95. It is designed for a reader's first or second exposure to computer programming, and is intended to provide a sound grounding for the reader who desires to study Fortran 90/95 in greater depth. Site describes book and lists contents in detail. http://www.users.bigpond.com/robin_v/f90-cont.htm

INTRODUCTION TO Fortran 90/95, ALGORITHMS, AND STRUCTURED PROGRAMMING, by R. A. Vowels, emphasizes fundamentals of structured programming through study of Fortran 90 (Fortran 95). It is designed for a reader's first or second exposure to computer programming, and is intended to provide a sound grounding for the reader who desires to study Fortran 90/95 in greater depth. The book is organized into two parts. The first part (Chapters to 9) is concerned with elements of Fortran 90. The second part (Chapters 10 to 21) introduces traditional and new algorithms. First Part - Fortran 90/95 and Structured Programming The first part emphasizes fundamentals of structured programming through study of a subset of Fortran 90/95. The subset is concise, well-defined, and is easy to learn. The first chapter outlines some historical aspects of computing. The second introduces the concept of algorithms, flowcharts, and complete working programs illustrating basic elements including conditional statements. Subsequent chapters cover numeric data, expressions and assignments, free format input and output (READ and PRINT), formatted input and output (READ and WRITE), loops and conditional statements, statement grouping using simple DO-loops, structured loops including DO WHILE, declarations, arrays, debugging, string data concepts, subroutines, functions, and program structure (modules, interface blocks, contained and external procedures). In this flexible text, some later chapters can be covered earlier, or may be omitted at first reading. For example, the chapter on string handling may be covered earlier if it is desired to provide practice in this area before others. The sections on formatted input-output may be omitted, or covered later.

177. Elsevier.nl - De Pagina Kan Niet Worden Weergegeven (Elsevier) Combinatorial algorithms, Optimization and computer Science. http://www.elsevier.nl:80/inca/publications/store/5/0/5/6/0/9/

var portalnaam = "elsevier"; dinsdag 20 september 2005 12:48 ZOEKEN Op deze site Op internet Home Help Sitemap Log in ... Maak Elsevier mijn startpagina DE BESTE PREMIER Een vakjury koos Willem Drees... Nieuws Nederland Politiek Europese Unie Buitenland ... Laatste 24 uur Opinie Commentaren Leon de Winter Essays Onderzoeken Beste woon- gemeenten Studie en werk Beste Scholen Elsevier Webgids ... Wie verdient wat? Persoonlijk Extra Relatie Auto kopen Hotels Routeplanner Service Elsevier op uw website of weblog Digitaal Archief RSS Nieuwsflitser ... Help Weekblad Deze week Abonneren Adres wijzigen Nabestellen ... Exclusief FOUTMELDING De pagina kan niet worden weergegeven De pagina die u zoekt is misschien verwijderd, de naam van de pagina kan zijn gewijzigd of de pagina is tijdelijk niet beschikbaar. Probeer het volgende: Controleer of u geen typefout hebt gemaakt in het pagina-adres dat u in de adresbalk hebt getypt. Klik op de knop Vorige om een andere koppeling te proberen. Indien u op zoek bent naar de meest actuele informatie op www.elsevier.nl

178. Algorithms And Data Structures In F And Fortran By Robin Vowels (Unicomp). Emphasizes fundamentals of structured programming through study of F and Fortran 90/95. It is designed for a reader's second exposure to computer programming, whether it be through selfstudy or a course in computer science. Site describes book, lists contents, and provides code examples. http://www.swcp.com/~walt/fortran_store/Html/Info/books/adsff.html

Algorithms and Data Structures in F and Fortran By Robin A. Vowels Published by Unicomp, 1998. 488 pages. $49.00 ISBN 0-9640135-4-1 Algorithms and Data Structures in F and Fortran emphasizes fundamentals of structured programming through study of F and Fortran 90/95. It is designed for a reader's second exposure to computer programming, whether it be through self-study or a course in computer science. The book is not just algorithms. Additional F/Fortran topics are included: separate theme chapter are devoted to complex arithmetic, file processing, list processing (the extensive chapter includes binary search trees), text processing including string searching, and recursion. Chapters can be studied in any order, as they are mostly independent; They can be selected at will according the reader's interests. The book is backed up by comprehensive appendices on the built-in procedures and summaries of the F and Fortran statements. It is recommended, although not essential, that the reader be familiar with the F or Fortrran 90/95 programming language, prior to using this text. One excellent introduction to F is Programmer's Guide to F The programs in the book are available here in zip format The programs in the book are available here in tar format A detailed table of contents is here The chapters are: Sorting Recursion Linked Lists and Trees Complex Arithmetic Using Published Algorithms Text Processing Files Solving Simultaneous Equations Graphics Searching Numerical Methods Whole Array Operations

179. Department Of Computer Science, The University Of Tennessee At Knoxville Offers B.S., M.S., and Ph.D. degrees in computer science. Research interests include algorithms and computability, scientific computing, genetic algorithms, image analysis, and neural networks. Online resources include UTK news reports and study abroad opportunities for computer science majors. http://www.cs.utk.edu/

University Links About the University Academic Programs Administration Libraries Research Support UT The University System A-Z Index WebMail Dept. Directory Select type of search People Search Campus Search System Search Admissions Undergraduate Admissions Graduate Admissions Transfer Students ... Contact Us ACM Bagel Morning. Thursday, 3rd February, 2004. [ more info... Jody DeRidder MS IT Administrator II Digital Library Center, University of Tennessee Libraries Message: I develop digital libraries, providing online searchable access to various special collections and research materials. Some of my work involves writing transformation scripts to extract and create on... [ more... JICS/Computer Science Associate/Full Professor Position 203 Claxton Complex Knoxville, Tennessee Phone: (865) 974-5067 Fax: (865) 974-4404 Email: info@cs.utk.edu Welcome Message On behalf of the faculty, I welcome you to the Department of Computer Science at the University of Tennessee at Knoxville - the flagship research university of the State of Tennessee. The department's mission is to produce scholars capable of creative work in computer science. [ more...

180. Ron Soferman Image Processing & Computer Vision Develops image processing algorithms for industrial and military projects. Features case studies and the list of clients. http://www.rsip.co.il/

Ron Soferman Home About Us Case Studies Clients ... Contact Us We have been involved in hundreds of projects; using our expertise to help many companies create their next generation products. From the Dairy Barn to the Clean Room RSIP is involved in an unimaginable variety of applications in Computer Vision including visual inspection, 3D reconstruction, tracking, computer graphics, pattern recognition and more. Whether it is the complete management of the project from A to Z or the professional level of work of a complex project, RSIP will be happy to contribute its experience to help you match your targets. Why Outsource Your Software Project? Reduce costs Shorten time-to-market Focus on your core business For tight schedules We specialize in the following areas: Visual Inspection Quality Control Measurements Image Enhancement Document Processing Medical applications Image Quality Veriety of image resources: Visual range UV and IR Ultra Sound x-ray CT MRI Images

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 9     161-180 of 192    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | 10  | Next 20