121. Florence, University Of Department of Systems and computer Science. Research areas include adaptive and predictive control, algorithms and data structures, applied mathematics, artificial intelligence, bioengineering and medical informatics, combinatorics, computer vision, databases, formal methods, modeling and identification, nonlinear dynamics, operations research, robust control, and software engineering. http://www.dsi.unifi.it/

Dipartimento di Sistemi e Informatica Department offices are in two different locations. Via di Santa Marta, 3 (Direction) 50139 Firenze Seg: +39.055.4796257 Fax: +39.055.47967363 Via C. Lombroso 6/17 50134 Firenze Seg:+39.055.4796731 Fax: +39.055.4796730 Visitatori Events People Research Teaching ... Webadmin

122. Department Of Computer Science, HKUST Department of computer Science. Research areas include theoretical computer science, algorithms, artificial intelligence, computer engineering, data and knowledge management and software technology. http://www.cs.ust.hk/

Latest News: Microsoft Imagine Cup 2004: 4th Runner-up CSAA: Guangzhou Observation Tour SIGGRAPH 2004: HKUST Makes Her Debut Best 10 Lecturers Award 2003-2004 ... FYP Announcements News Schedules Seminars Thesis defense ... FAQ Courses Descriptions Quota PG courses Research ... Computing Facilities for Department Users Recruitment Faculty Search Job Openings CS System Group News ... CSAA Computer Science Alumni Association CSSS Computer Science Students' Society Restricted Access Area For internal use only Other Information Directions to the department: Local Transportation Driving International Symposium on Algorithms and Computation (ISAAC 2004) Advanced search Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong Tel : +852-2358-7000 Fax : +852-2358-1477 E-mail : csdept Last updated on June 7, 2004 by cssystem Please send comments and suggestions to webmaster Department of Computer Science The Hong Kong University of Science and Technology

123. CTW2001 Topics are graph theory and discrete algorithms (both deterministic and random) and their applications in operations research and computer science. Institute of Mathematics, Center of Applied computer Science, University of Cologne; 68 June 2001. http://www.zaik.uni-koeln.de/AFS/conferences/CTW2001/CTW2001.html

1st CologneTwenteWorkshop on Graphs and Combinatorial Optimization CTW 2001 Institute of Mathematics and Institute of Computer Science Center of Applied Computer Science University of Cologne Cologne, Germany June 6-8, 2001 Presentations at the Workshop Following the tradition of previous workshops, a special issue of Discrete Applied Mathematics will be prepared in connection with the recent 1st Cologne/Twente Workshop on Graphs and Combinatorial Optimization. All interested researchers are invited to contribute to this special volume. The topics should relate to the central themes of the workshop (graphs, combinatorial optimization and the design and analysis of algorithms) but are not necessarily restricted to the presentations at the workshop. Theoretical and applied work is equally welcome. All articles will be thoroughly refereed according to the standards of Discrete Applied Mathematics. Submission deadline is: 30 September, 2001 You may send your submission electronically (ps-file) to the address ctw@zpr.uni-koeln.de

124. ACM SIGACT Special Interest Group on algorithms and Computation Theory, the ACM special interest group for Theoretical computer Science. Site has membership information, meetings, reports and a newsletter for members. http://sigact.acm.org/

ACM SIGACT Institutional Sponsors Membership Information Activities SIGACT News and ... Reviews and Reports The primary mission of ACM SIGACT (Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory) is to foster and promote the discovery and dissemination of high quality research in the domain of theoretical computer science. The field of theoretical computer science is interpreted broadly so as to include algorithms, data structures, complexity theory, distributed computation, parallel computation, VLSI, machine learning, computational biology, computational geometry, information theory, cryptography, quantum computation, computational number theory and algebra, program semantics and verification, automata theory, and the study of randomness. Work in this field is often distinguished by its emphasis on mathematical technique and rigor. SIGACT Headlines, Current Events, and Links A Tribute to Robert W Floyd by Don Knuth SIGACT News vol. 34, no. 4 ]. Adapted from a lecture archived at the Stanford Center for Professional Development SIGACT Annual Report 03 See our New Server's Usage!

125. FSU Jena:Department Of Mathematics And Computer Science Faculty of Mathematics and computer Science. Research areas include algorithms and data structures, computational complexity, database and information systems, software engineering, programming languages, practical and technical computer science, digital image processing, and computer architecture. http://www.minet.uni-jena.de/english/

Studies Information Beginner's Guide Search ... Friedrich-Schiller-University Jena Department of Mathematics and Computer Science Organisation and Structure Studies Dean's Office Research Units and Chairs Computing Center Information Services ... ECTS News and Events Information Semester Dates Lectures at the Department / Timetables Lecture Information: Mathematics Computer Science Events Announcements ... Faculty / Staff Students' Union : Mathematics Computer Science Reports Statistics ... Deutsch This page was last modified on 05th May, 2004 Webadmin

126. Research Areas - Graduate Studies - CS - Programs - Baskin School Of Engineering Research on decision theory, neural networks, computational biology, computational geometry, theoretical computer science, online learning algorithms, computational learning theory, reinforcement learning. http://www.soe.ucsc.edu/programs/cs/graduate/research.html#ai

Home Programs CS Graduate Studies Research Areas Research Areas - Computer Science CS Graduate Requirements Current Requirements Continuing Students Breadth Requirement Approved Electives ... Exam Committee CS Graduate Program Introduction Research Areas Faculty Courses CS Class Schedule Graduate Studies Admissions Financial Support CS Department Home Page ... Software, Web, and Internet Engineering Algorithms, Logic, and Complexity David Helmbold (CS) Phokion Kolaitis (CS) Allen Van Gelder (CS) Manfred Warmuth (CS) The goal of pragmatic computer science is to develop systems that fully exploit the capabilities of current computer technology. The goal of theoretical computer science is to understand the underlying principles of information processing, principles that are invariant with respect to technological change. Some of the areas we are investigating are described below. Analysis of Algorithms An algorithm with exponential asymptotic running time is of limited practical value regardless of future advances in hardware technology. Members of the faculty are searching for efficient, practical algorithms to solve problems in coding, scheduling, logic, computational geometry, information retrieval, and programming-language optimization. We are also studying the approximation properties of NP optimization problems and developing methods for establishing both positive and negative approximation results for such problems. Parallel Computation Recent advances in VLSI have made it possible to use multiple processors to tackle a single problem. Efficient algorithms for a parallel system have characteristics far different from traditional sequential algorithms. Furthermore, some problems appear to be inherently sequential, in the sense that no parallel algorithm can significantly reduce the computation time needed to solve them. Our research has concentrated on distinguishing inherently sequential problems from those that can be solved quickly with parallel algorithms and on designing efficient parallel algorithms, particularly for scheduling and graph problems.

127. Welcome To The VRS Homepage A computer graphics software library for constructing interactive 3D applications. Provides a large collection of 3D rendering components that facilitate implementing 3D graphics applications and experimenting with graphics algorithms. Distributed under the GNU Lesser General Public License. http://www.hpi.uni-potsdam.de/vrs/

Your browser doesn't support frames. Please upgrade to the latest version of Internet Explorer or Opera

128. School Of Computing Science At SFU School of Computing Science. Research labs focus on algorithms and optimization, systems science, computational epidemiology, computer vision, database systems, graphics and multimedia, hardware design, software agents, intelligent software and systems, knowledge representation, logic and functional programming, medical computing, natural language processing, parallel and distributed computing, mathematical sciences, programming languages, simulating and exploring ecosystem dynamics, and distance learning. http://www.cs.sfu.ca/

About Us People Research Grad ... Search Conferences past conferences SAT 2004 - May 10-13, 2004 HPCS '04 - May 16-19, 2004 TAG '04 - May 20-22, 2004 ... RANDOM 2004 - August 22-24, 2004 News past news items COIN-OR Foundation Created - Summer 2004 Seminars and Events all seminars Scholarship News past scholarship news 2004 Dean of Applied Sciences Convocation Medal recipient, Bistra Dilkina 2004 Dean of Graduate Studies Medal recipient - Manuel Zahariev CSSS Spring 2004 Award Winner - Michael Schwartz ... MSc/PhD Theses Academic Programs Graduate Studies Undergraduate Studies School of Computing Science Faculty of Applied Sciences ... csweb@cs.sfu.ca

129. Home Page Of Werner Pohlmann University of Salzburg Programming, software engineering, programming languages, performance and reliability of communication and computer systems, parallel and distributed algorithms, and distributed discrete event simulation. http://www.cosy.sbg.ac.at/~pohlmann/pohlmann.html

Werner Pohlmann About me Teaching Click here for information on current courses. Current research Main subject of current work: "Distributed discrete event simulation": Click here for some recent publications. Addresses Email pohlmann@cosy.sbg.ac.at Snail mail page created especially for you by tom tom@cosy.sbg.ac.at file last modified: Tuesday, 27-Apr-2004 07:43:28 CEST

130. Institutionen För Informationsbehandling - Huvudsida Department of computer Science. Research areas include programming methodology, probabalistic algorithms, software quality, applied artificial intelligence, and Linux. http://www.cs.abo.fi/

Turku Centre for Computer Science Vid institutionen bedrivs också forskning inom ett flertal forskningsprojekt. För åren 2002-07 har projektet "Formal Methods for Programming" av Finlands Akademi fått status som spetsforskningsenhet. Telefon: +358-2-2154475, Telefax: +358-2-2154732

131. Computer Programming E-Books A collection of computer Science algorithms in a Series of EBooks and individual Lessons C, C++ and Java. http://www.csebooks.com/

COMPUTER SCIENCE E-BOOKS www.csebooks.com Learn Computer Programming from an E-Book! C, C++, Java, Advanced Java, J2EE-EJB, VB, HTML, JavaScript, ASP, Data Structures Each E-Book contains all Lessons for one complete programming course. Each Lesson contains Questions and Exercises. You need Acrobat PDF Reader to view the E-Books Visit our 3D E-Book Gallery Students use E-Books for reference, self-study or E-Learning. (Price of E-Book does not include marking of Exercises) The E-Books are designed for easy reading with step by step programming instruction and explanation. Web Programming E-Books Click for Description Press to Order Price Click for Description Press to Order Price HTML E-BOOK JAVASCRIPT E-BOOK ASP E-BOOK VB Programming E-Books Click for Description Press to Order Price Click for Description Press to Order Price VB E-BOOK C/C++ Programming E-Books Click for Description Press to Order Price Click for Description Press to Order Price C E-BOOK C++ E-BOOK Java Programming E-Books Click for Description Press to Order Price Click for Description Press to Order Price JAVA E-BOOK JAVA GUI E-Book ADVANCED JAVA E-BOOK EJB JAVA E-BOOK Data Structure Programming E-Books Click for Description Press to Order Price Click for Description Press to Order Price C DATA STRUCTURES C++ DATA STRUCTURES JAVA DATA STRUCTURES About us Visit our Sponsers Page Order Buttons ... not working ?

132. APPROX 2004 + RANDOM 2004 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/

APPROX 2004+RANDOM 2004 7th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 8th International Workshop on Randomization and Computation 22-24 August 2004, Cambridge MA Radcliffe Institute for Advanced Study, Harvard University Call For Papers Accepted Papers Local information

133. FB-Informatik (TU-KL) -- Department Of Computer Sciences Department of computer Science. Research involves software components, algorithms, CAD, computer graphics, computational geometry, information management, computer networks, database and information systems, computer architecture, numerical algorithms, foundations of computer science and programming, communication systems, system software, robotics, artificial intelligence, software engineering, learning, programming languages and compiler constructions, and VLSI design. http://www.informatik.uni-kl.de/english/

Fachbereich Informatik der TU Kaiserslautern Auf dieser Website wurden Frames eingesetzt. Ihr aktueller Browser stellt keine Frames dar oder die Darstellung von Frames wurde abgeschaltet. Bitte wählen Sie: Zugriff auf die Komponenten Seiteninhalt oder Zugriff auf die Webseiten in vereinfachter Darstellung

134. Institut Für Computergraphik Und Algorithmen Institute of computer Graphics and algorithms. algorithms and Data Structures Group (Prof. Mutzel). computer Graphics Group (Prof. Purgathofer). 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. please sign the petition too! 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

135. Www.datgen.com Datgen, formerly SCDS, is a computer program that generates data to systematically test programs that consume data. These synthetic datasets can be used to validate learning algorithms. http://www.datgen.com/

A frames capable web browser is needed to view this page.

136. Computer Music In Introductory CS Courses Listen to computer Science algorithms. Judy Franklin computer Science Department Smith College Northampton, MA 01063 jfranklin@cs http://www.cs.smith.edu/~jfrankli/music/algorithms.html

Listen to Computer Science Algorithms Judy Franklin Computer Science Department Smith College Northampton, MA 01063 jfranklin@cs.smith.edu Student Collaborators: Liz Laverty, Veronica Morales, Shana Negin Generating Grains using Sinusoids Click here to hear the result. Quick Sort The quick sort is another algorithm that we used to generate grains of sound in order to form a composite sound wave. Recall that the quick sort is a recursive algorithm that first finds the midpoint value of the list. Then it starts at the endpoints and moves toward the center. Whenever an element on the left is greater than the center, it is swapped with an element on the right that is less than the center in value. The result is a list that is composed of two unsorted sub-lists, but each element in the first sub-list is less than each element in the second sub-list. Quick sort is then called recursively on each sub-list. As the quick sort is sorting our randomly generated list, whenever two values are swapped, the indices of both values are stored in a second array, in a manner similar to that described above for the bubble sort. Once again, the actual values being sorted are irrelevant. It is only the index values that are important and that reflect the mechanics of the quick sort. As before, after the sort, a 0.1 second long sinusoid with frequency scaled by an index value, is generated; one grain is generated for each index value in the second array. The grains are again placed side by side to create one long sound wave that demonstrates the algorithm.

137. Carleton University School of Computing Science. Research labs focus on object oriented programming, software engineering, pervasive computing, networks, network security, parallel and distributed computing, algorithms, computer vision, database systems, graphics and multimedia, software agents, intelligent software and systems, knowledge representation, logic and functional programming, medical computing, natural language processing. http://www.scs.carleton.ca

Connect Current Students Prospective Students Campus Map ... School Directory SCS News Headlines MSDNAA Software Available for SCS students The School of Computer Science is proud to announce an agreement with Microsoft Canada for direct student software download of many Microsoft products ( XP, .Net, Visio, etc). Carleton University is the first university in Canada that will offer this program. [ continue... SCS Student Recipient of the CIPS Scholarship On April 15, the academic excellence of Miss Gail Banaszkiewicz, 2nd year student in Computer Science was recognized at the CIPS annual breakfast. Gail was selected as the recipient of the CIPS Scholarship in the School of Compter Science. SCS students win OCRI awards Three Carleton University students cornered the market at the Ottawa Centre for Research and Innovation (OCRI) Futures Awards. [ continue... New Multidisciplinary Programs Starting Fall 2004 the School of Computer Science will offer two new multidisciplinary streams in the Bachelor of Computer Science program: Bioinformatics and Psychology. These new streams, along with the existing Management and Business stream, supplement our usual program in computer science and software engineering with intensive training in an important application area for computer scientists. [ continue...

138. GFX Computer Graphics Programming Several articles on advanced graphics programming, mostly 3Drelated. http://xarch.tu-graz.ac.at/home/rurban/news/comp.graphics.algorithms/gfx/gfx_ind

Trilinear MIP Mapping Digital Line Drawing Optimising BSP Tree Traversal Polygon Scan Conversion Trilinear MIP Mapping Digital Line Drawing Optimising BSP Tree Traversal Polygon Scan Conversion ... Skeletal Animation

139. University Of Warwick: Computer Science: : Department of computer Science, University of Warwick, UK; 3 May 2002. http://www.dcs.warwick.ac.uk/~msp/ACD.html

Accessibility Contact Us A-Z Index Home ... People [n] Local Navigation Computer Science General Admissions Undergraduate ... Privacy Forbidden - Error 403 Access to this page is denied, this could be because you need to be on campus to access the page or, in rare cases, where access to the page has been withdrawn by the owner. You can try using the tabs above to move to one of the main sections of this site. If you still think that you should be able to view the page then, contact the Please include in your message the URL of the page you are trying to access . (It can be found in the Location: or Address: field at the top of your browser). Last revised: Tuesday 24 Feb 2004, 15:07 Back to top of page

140. Table Of Contents computer ANIMATION algorithms AND TECHNIQUES. Rick Parent, computer Animation algorithms and Techniques, MorganKaufmann, 2001. TABLE OF CONTENTS. http://www.cse.ohio-state.edu/~parent/book/outline.html

COMPUTER ANIMATION: ALGORITHMS AND TECHNIQUES So you want to do Computer Animation? Computer Animation information page Rick Parent, Computer Animation: Algorithms and Techniques Morgan-Kaufmann, TABLE OF CONTENTS Preface Introduction Overview Perception ... Appendices A.1 Interpolation and Approximation A.2 Physics Primer A.3 Numerical Techniques A.4 Vector Algebra Summary References Rick Parent (parent@cis.ohio-state.edu) Last updated 5/19/00

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