101. Top Ten Algorithms Engineering. If you use a computer, some of these algorithms are no doubt crunching your data as you read this. The drum roll, please http://www.cecm.sfu.ca/personal/jborwein/algorithms.html

Algorithms for the Ages 1946: The Metropolis Algorithm for Monte Carlo. Through the use of random processes, this algorithm offers an efficient way to stumble toward answers to problems that are too complicated to solve exactly. 1947: Simplex Method for Linear Programming. An elegant solution to a common problem in planning and decision-making. 1950: Krylov Subspace Iteration Method. A technique for rapidly solving the linear equations that abound in scientific computation. 1951: The Decompositional Approach to Matrix Computations. A suite of techniques for numerical linear algebra. 1957: The Fortran Optimizing Compiler. Turns high-level code into efficient computer-readable code. 1959: QR Algorithm for Computing Eigenvalues. Another crucial matrix operation made swift and practical. 1962: Quicksort Algorithms for Sorting. For the efficient handling of large databases. 1965: Fast Fourier Transform. Perhaps the most ubiquitous algorithm in use today, it breaks down waveforms (like sound) into periodic components. 1977: Integer Relation Detection.

102. SimpleJ A collection of easy to use multipurpose Javabeans providing commonly used methods for handling I/O, arithmetic, and general commonly used algorithms used in computer science. Open source, BSD License http://simplej.berlios.de/

Overview simple J is a collection of easy to use multi-purpose Java beans. They provide commonly used methods for handling I/O, arithmetic, and general commonly used algorithms used in computer science. Intended audience: programmers and computer science students. The project website is coming soon. For now check out simplej project page at berlios. Download At the moment you can only download a preview pre-release [zip]. Author Maciej Plewa Project hosted by

103. DSI. Main Page computer Science Department. Research areas include algorithms, computer architecture, computer networks, combinatorics, computational complexity, database theory and management, formal methods, paradigms of computation, pictorial and linguistic computation, and random structures. http://www.dsi.uniroma1.it/

Il sito ha cambiato indirizzo il nuovo e' http://w3.uniroma1.it/dipinfo

104. CUHK :: Department Of Computer Science & Engineering Department of computer Science and Engineering. Research areas include algorithms, Chinese processing, high performance computing, intelligent systems, parallel and distributed computing, rapid system prototyping, visualization, virtual reality and VLSI/CAD. http://www.cse.cuhk.edu.hk/

Chinese Computer Terminology Privacy Search Sitemap Chinese Computer Terminology Privacy Search Sitemap

105. Graph Drawing 2000 The symposium is a forum for researchers and practitioners working on all aspects of graph visualization and representation. The range of topics considered in graph drawing includes graph algorithms, graph theory, geometry, topology, visual languages, visual perception, information visualization, computerhuman interaction, and graphic design. Colonial Williamsburg (Virginia, USA) 2023 September 2000. http://www.cs.virginia.edu/~gd2000/

Colonial Williamsburg (Virginia, USA) September 20-23, 2000 Important News! will be held in Vienna, Austria during September 23-26, 2001. Check out the website!! Workshop on Data Exchange Formats was held on 20 Sept 2000. The report is available here - The GD 2000 Proceedings proceedings are in production, and will ship early in 20001 as Volume 1984 of the Lecture Notes in Computer Science series. Each person registered for GD2000 will automatically receive a copy of the proceedings. (We will update this site once we know they have shipped.) The GD2000 Proceedings are available directly from Springer Verlag. If the previous link is not working for you (it sometimes gets confused) you can Search the Springer Verlag catalogue looking for ISBN '3-540-41554-8'. Contents Instruction for authors Schedule/Program (new! advanced program) A Satellite Workshop on Data Exchange Formats will be held on 20 Sept 2000. (new!) Deadlines Colonial Williamsburg Information Registration and Hotel Accommodation (updated 20 Aug 2000) Location (new! travel info)

106. Algorithms Courses On The WWW Links to courses in algorithms maintained at various university computer science departments. http://www.cs.pitt.edu/~kirk/algorithmcourses/

Another Brick in the Wall part 2 (Waters) We don't need no education We don't need no thought control No dark sarcasm in the classroom Teachers leave them kids alone Hey! Teachers! Leave them kids alone! All in all it's just another brick in the wall. Note this site is continuously under construction I have found that links to courses and instructors are too unstable. Thus most of the links below are to listing of course home pages maintained at various computer science departments. Once there, you should search for Algorithms , and then follow the appropriate link. Suggestions for good links to add to this page, and corrections can be made by emailing me at kirk@cs.pitt.edu Note that I no longer put any real effort into maintaining this page. Undergraduate and Introductory Graduate Courses Jeff Edmonds' introductory algorithms notes Kirk Pruhs, University of Pittsburgh Stanford theory group ... UC Berkeley theory group and UC Berkeley classes CMU Algorithms group with course information Cornell courses Princeton courses ... University of Wisconsin courses (No course titles; Check for courses taught by Bach and Joseph) Toronto courses Harvard courses Cal Tech courses Brown courses UCLA courses ( undergrad grad Yale courses Maryland courses ... Arizona courses is algorithms) Virginia courses Some reliable links to people/courses that have been stable for years:

107. Local Math-Net Guide Department of Mathematics and computer Science. Research areas include logic synthesis and verification, digital systems verification, genetic algorithms for routing, LEDA, graph drawing algorithms, parallel algorithms and programming, and compilers and runtime prediction for distributed memory machines. http://www.mathematik.uni-halle.de/

Navigator English Uni Homepage Homepage des Fachbereichs ... Martin-Luther-Universität Halle-Wittenberg Allgemeines Organisation Forschung Arbeitsgruppen Preprints Projekte Software Personen Studierende Lehre Lehrveranstaltungen Lehrmaterial Aktuelles Veranstaltungskalender Stellenanzeigen Georg-Cantor-Vereinigung Informationsdienste HA-16: Zweigbibliothek Mathe, ULB ULB Sachsen-Anhalt Lokale Suche: Math-Net Projekt in Halle Erweiterte Suche: Mathematik und Informatik in Halle Universität Halle Mathematik in der Region

108. Centre Of Computer Graphics And Data Visualisation University of West Bohemia. Research areas include algorithms for computer graphics and visualization,volume data processing, methods for isosurface extraction, mesh reduction and reconstruction from scattered data, triangular and tetrahedral mesh generation. http://herakles.zcu.cz/

Visitors Welcome to the Centre of Computer Graphics and Data Visualisation at the Department of Computer Science and Engineering at the University of West Bohemia in Plzen Czech Republic . These pages provide information about the structure and personnel of the laboratory, about teaching and research activities. In February The International Conferences in Central Europe on Computer Graphics, Visualization and Computer Vision is held every year. December 2002 Statistics added. November 2002 People page. Research. Publications. Informal. See recent updates Centre of Computer Graphics and Data Visualisation Department of Computer Science and Engineering University of West Bohemia Univerzitni 8, BOX 314, 306 14 Plzen Czech Republic E-mail: cgdv@fav.zcu.cz Voice: +420-377-63-2401 Fax: +420-377-63-2402 Last Update: 09.12.2002

109. Robot Learning Laboratory Home Page Research on Localization and Mapping, Partially Observable Markov Decision Processes, computer Vision and Image Processing, Robot Architectures and Programming Languages, Learning algorithms. http://www.cs.cmu.edu/afs/cs.cmu.edu/Web/People/Xavier/lab.html

The Robot Learning Laboratory! Welcome Research Publications Members ... Old homepage (before 96) We are proud members of the School of Computer Science and the Robotics Institute at Carnegie Mellon University Financial support by DARPA, NSF, Daimler Benz, WebTV (and thus Microsoft) and Sun Microsystems is gratefully acknowledged. Web page contact: chuck+@cs.cmu.edu First Edition: 4/2/98 Last Update: 11/21/98

110. Kitware Inc. - Leaders In Visualization Technology VTK is an open source, freely available software system for 3D computer graphics, image processing, and visualization. Supports a wide variety of visualization algorithms including scalar, vector, tensor, texture, and volumetric methods http://www.kitware.com/

HOME COMPANY PROFILE VTK CASE STUDIES ... CONTACT US var MenuLinkedBy='AllWebMenus [2]', awmBN='494'; awmAltUrl='';

111. GFaI - AMSPR Project descriptions, publications, and software/data downloads of new algorithms for modeling techniques, pattern recognition and optimization tasks. Part of the Center for Applied computer Science, Berlin. http://www.amspr.gfai.de

Adaptive Modelling and Pattern Recognition Welcome to the Research Group Adaptive Modelling and Pattern Recognition at the Center for Applied Computer Science Berlin (GFaI e.V.). Our work targets the development and application of new algorithms for modelling techniques, pattern recognition and optimization tasks. The application area covers control systems, image processing and object recognition. Main research topics are: Neural Networks, Evolutionary Computation Techniques, Image Feature Extraction Techniques, Parallel Computing, Statistical Learning and Surface Inspection. Services Project Descriptions Software and Data Download Publications Group Computing Facilities ... Personal Pages Contact: Dr. Hans-Michael Voigt , Phone: +49-30-6392 1616 © GFaI, Author: Karsten Neß

112. Home Page Of The CS Algorithms And Complexity Group On Plg.uwaterloo.ca Research areas include design and analysis of algorithms, models of computation, and computational complexity. http://plg2.math.uwaterloo.ca/~cstheory/

Theoretical computer science at the University of Waterloo Work in theoretical computer science seeks to uncover and to explain the structures underlying computational processes. Theoretical work can inspire new approaches to the design of hardware and software, or it can try to model the difficulties encountered in existing designs in an attempt to understand them. The gap between theory and practice is narrowed when theoreticians apply their insights to real-world problems, or when they work with practitioners on experimental and/or practical projects; these activities are encouraged at Waterloo. Topics in theoretical computer science being studied at Waterloo within the Algorithms and Complexity group (formerly the Theory group) can be loosely categorized into two major areas: Design and analysis of algorithms The design and analysis of algorithms on general-purpose models of computation draws inspiration from basic building-block problems (data structures, graph theory and graph-theoretic algorithms), problems in other areas of computer science (theory of programming languages, program methodology, theory of databases, learning theory, VLSI theory), and from computational problems arising in other disciplines (computational biology, algorithmic number theory, computational geometry). Models of computation and computational complexity Defining special models of computation and using mathematical tools to demonstrate the consequences of those definitions (as is done in formal languages, theory of automata, structural and computational complexity, parameterized complexity, theory of asynchronous circuits and hardware testing, parallel computation, Kolmogorov complexity) can lead to new insights into particular problems, or into the structure of a whole class of problems.

113. Computer Science And Software Engineering Department of computer Science. Research areas include design and analysis of algorithms, computer architecture and VLSI, databases and information systems, mathematics of computation, parallel and distributed computing, artificial intelligence, programming languages and methodology, and theoretical computer science. http://www.cs.concordia.ca/

Prospective Students Current Students About Us People ... Department of CS http://www.cs.concordia.ca Last modified on May 4, 2004 by webmaster@cs.concordia.ca

114. N. Petkov University of Groningen computational neuroscience, image processing, pattern recognition, computer vision, parallel and high pefomance computing, and systolic algorithms. http://www.cs.rug.nl/~petkov/petkov.html

Nicolai Petkov Address and contact information Professional biography sketch Research publications ... Teaching (for sortcut to reader APPHPS click here: pdf 1200 KB Hobbies Vacancies Professional biography sketch Nicolai Petkov is the author of two books and of further 90 scientific papers. He is member of the editorial boards of Journal of Neural, Parallel and Scientific Computations (Dynamic Publ.), Parallel Algorithms and Applications (Gordon and Breach) and Real-Time Imaging (Academic Press). Research My current research focusses on computer simulations of the visual system and the development of biologically motivated image pattern recognition methods. I use functional descriptions of different types of visual neuron in the cortex to develop computational models and image processing operators. This research aims at better understanding of the brain on the one hand and the development of effective computer vision algorithms on the other hand. In the image shown to the left, a triangle is superimposed on a grating of bars. While two of the triangle's legs are very salient, the third leg which coincides with one bar of the grating is not perceived as part of the triangle at all: our visual system groups it with the grating bars rather than with the other legs of the triangle. By means of computer simulations of the function of cells in the primary visual cortex we demonstrated that this perceptual effect is due to a neural mechanism known as non-classical receptive field inhibition or surround suppression. You can read more about this in

115. Turku, University Of Department of computer Science. Research groups investigate space efficient algorithms, image compression, management of large textual databases, object tracking, bioinformatics, scheduling algorithms, biomedical signal analysis, parallel machines and algorithms, database management, artificial neural networks, and computer aided analysis of medical images. http://www.cs.utu.fi/

116. Parallelism, Algorithms And Architectures Research Centre Department of computer Science. http://parc.lboro.ac.uk/

Research Events New! Information about PARADAY V is now available. People Contact This page last modified: Wed May 26 11:41:20 2004

117. Computer Security Group Research Interests Security Protocols, Formal Methods, Reliability of Security Systems, Medical Information Security, Cryptographic algorithms, Steganography Information Hiding, Digital Watermarking, Hardware Security, Electronic Commerce http://www.cl.cam.ac.uk/Research/Security/

Introduction Research Topics People in the Group Contact Information ... University of Cambridge Computer Laboratory, University of Cambridge. Contact group webmaster for more information or comments. Last updated: 14th February 2001.

118. Operational Research Programming Trivia computer code for research algorithms in operational research and combinatorial optimization. http://www.ortrivia.com

This page uses frames, but your browser doesn't support them. It is likely that your browser doesn't support XML either, so you cannot see most of this site. Use the links below and hope for the best. Title Page Page Sections Code Sections

119. Bibliography On Genetic Algrorithms Genetic algorithm citations starting with ICGA and FOGA. Part of the computer Science Bibliography Collection at the Universitat Karlsruhe in Germany. http://liinwww.ira.uka.de/bibliography/Ai/genetic.algorithms.html

The Collection of Computer Science Bibliographies Up: Bibliographies on Artificial Intelligence Collection Home Bibliography on Genetic Algrorithms About Browse Statistics Number of references: Last update: January 9, 1998 Number of online publications: Supported: no Most recent reference: Search the Bibliography Query: Options case insensitive Case Sensitive partial word(s) exact online papers only Results Citation BibTeX Count Only Maximum of matches Help on: [ Syntax Options Improving your query Query examples Boolean operators: and and or . Use to group boolean subexpressions. Example: (specification or verification) and asynchronous Information on the Bibliography Author: Thomas Haynes (email mangled to prevent spamming) Department of Computer Science Wichita State University Wichita, KS 67260 USA Abstract: Genetic algorithm citations. Starting with ICGA and FOGA citations. Keywords: genetic algorithms, icga, foga, ppsn Browsing the bibliography Original source: Used to be available at http://www.cs.twsu.edu/~haynes/ga.bib but has disappeared. Other sites: http://www.cs.twsu.edu

120. Orbital Library A class library providing objectoriented representations and algorithms for logic, mathematics and artificial intelligence. It comprises theorem proving, computer algebra, search and planning, as well as learning algorithms. http://www.functologic.com/orbital/

Home About Computer Science Orbital library ... Site Map Orbital library Home The Orbital library is a class library providing object-oriented representations and algorithms for logic, mathematics and artificial intelligence. It comprises theorem proving, computer algebra, search and planning, as well as machine learning algorithms. Generally speaking, the conceptual idea behind the Orbital library is to provide extensional services and components for Java, which surround the heart of many scientific applications. Hence the name Orbital library. In order to satisfy the requirements of high reusability, the design of this foundation class library favors flexibility, conceptual simplicity and generalisation. So many sophisticated problems can be solved easily with its adaptable components. See the summary of features , and the review document for more information. However, for a closer look, refer to the online documentation . As a brief overview of the documentation, also refer to the hints recommending very important classes You can get this Java library and its documentation here: download Orbital library and documentation browse the documentation online browse the documentation online (alternative server, with less examples)

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 6     101-120 of 183    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | 10  | Next 20