101. School Of Computer Science | University Of Waterloo Department of computer Science. Research areas include algorithms and complexity, artificial intelligence, computer graphics, databases, distributed systems, programming languages, scientific computation, software engineering, symbolic computation, text management, user interfaces, and very large scale integration. http://www.math.uwaterloo.ca/CS_Dept/homepage.html

Events 2005 September 8: Hongmei Zhu, York University. A new image transform with medical applications. Part of the Computational Mathematics seminar series. 2005 September 17 and September 24: Waterloo programming contests. Waterloo's ACM Contest teams will be chosen according to the results of these contests. ... Other talks in the School of Computer Science The School of Computer Science takes pride in its diversity of strengths, innovation in research and education, and close contact with surrounding high-tech companies. Housed in the Faculty of Mathematics, the School comprises 72 faculty members, nearly 300 graduate students, and 1800 undergraduates. News New faces in the crowd: Ed Lank New Assistant Professor Edward Lank has been on both sides of the computer science divide, having worked in both the private and academic sectors. He has served as Chief Technical Officer at Canadian startup MediaShell, as a researcher at Xerox's Palo Alto Research Center, and on the faculty of San Francisco State University. Although he officially joins the faculty full-time in June 2006, he has taken a semester's sabbatical to come here this fall as a Research Assistant Professor. Read More ...

102. Home Page Jochen Pfalzgraf University of Salzburg Application of mathematics to computer science, multi-agent systems, artificial neural networks, fuzzy reasoning, genetic algorithms, automated deduction in geometry, and semantical modelling http://www.cosy.sbg.ac.at/~jpfalz/jpfalz.html

Jochen Pfalzgraf O.Univ.-Prof. Dipl.-Math. Dr. Jochen PFALZGRAF Ordinarius (Full Professor) AG "Wissensbasierte und Lernende Systeme. Mathematische Informatik" (WG "Knowledge-based and Learning Systems. Mathematical Informatics") Fachbereich Informatik (Department of Computer Science) (University of Salzburg) Jakob-Haringer-Str. 2 A-5020 Salzburg Austria phone: + 43 662 8044 6309 fax: + 43 662 8044 611 e-mail: jpfalz@cosy.sbg.ac.at, jochen.pfalzgraf@sbg.ac.at Please Read Me First EMMY NOETHER Outstanding Mathematician Fields of Interest and Work Local Working Group and ... On General Mathematical Modeling Aspects. Mathematical Informatics

103. University Of Strathclyde Department of computer Science. Research groups algorithms problems empirical studies; Software engineering; High performance information systems; Advanced use of computers in education; Highlevel internet programming with persistent objects; High-performance networks. http://www.cs.strath.ac.uk/home.html

104. Department Of Computer Science Home Page Loughborough University Research centres Advanced virtual reality; Telecommunications and computerhuman interaction; Parallel algorithms and architectures. Research groups Creativity and cognition; Graphics, design and intelligent systems; Interactive mechanisms for process control and communications technology; Information systems engineering; Applicable formal methods. http://www.lboro.ac.uk/departments/co/

Computer Science Loughborough University Tel: +44 (0) 1509 22 2681 E-mail: CompSci@lboro.ac.uk About Us Research Undergraduate Opportunities ... University Links News New postgraduate taught course for 2006: New undergraduate courses for 2006 Visit the Department - see dates for 2006 entry Tuition fee information for UK/EU undergraduate students beginning programmes in October 2006 Read what international students ... say about the Department Search the Computer Science web site Website maintained by: P.J.Holligan@lboro.ac.uk All Rights R eserved - Loughborough University - Great Britain

105. About TUCS - TUCS A research centre in computer Science for the three universities in Turku. Research groups covers algorithmics, biomathematics, coding theory, computational intelligence for business, information systems, advanced management systems, probabilistic algorithms, software quality, programming methodology, applied artificial intelligence, strategic information systems planning, and mathematical structures in computer science. http://www.tucs.fi/

About TUCS Research Education Personnel Downloads ... Links Search our site Recent news 20th Sep 05 TUCS-DAY - Information and outdoor activities! 16th Sep 05 Seminar: Information and Communication Technologies in Scientific Collaboration More news Contact Information Turku Centre for Computer Science FIN-20520 Turku Phone: +358-2-2154204 Fax: +358-2-2410154 E-mail: tucs@abo.fi Welcome to TUCS WWW pages Turku Centre for Computer Science (TUCS) is a joint research and education centre between the University of Turku à bo Akademi University and the Turku School of Economics and Business Administration TUCS coordinates research and education in the field of Information Technology. These activities are carried out in the TUCS Master's and Graduate Schools and in the centre's own research laboratories At the departments participating in TUCS there are presently about 35 professors, 50 Ph.D. level researchers, 100 doctoral students and 2000 Master's students. The following departments participate in TUCS and its Graduate School: University of Turku Department of Information Technology Computer Science Electronics information technology Department of Mathematics Mathematics à bo Akademi University Department of Computer Science Department of Information Systems Turku School of Economics and Business Administration ... Institute of Information Systems Sciences Director of TUCS: Professor Hannu Tenhunen , University of Turku, Dept. of I.T.

106. Redirect Intel's open source computer vision library contains implementation of useful algorithms, like optical flow methods, snakes, binary morphological operations, pyramids, and camera calibration. http://www.intel.com/research/mrl/research/opencv/

US Home Intel Worldwide Where to Buy Contact Us ... Standards This content has been moved. You will be redirected to the new location in 5 seconds, or click here to go there immediately.

107. COmputer Security And Industrial Cryptography Kuleuven Univ, Belgium. Interests Design, evaluation, and implementation of crypto algorithms and protocols, and on the development of security architectures for computer systems and telecom networks. Also theoretical work in crypto algorithms related to discrete mathematics. http://www.esat.kuleuven.ac.be/cosic/

COSIC: Home All SISTA COSIC DocArch For information on a specific research group select one of the links above Home About People Research ... Contact Info COSIC CO mputer S ecurity and I ndustrial C ryptography Press release: August 12, 2003 - Vulnerability in Secure Login Token Discovered ( Dutch English Press release: February 27, 2003 - NESSIE project announces final selection of crypto algorithms ( English General info about COSIC's current and past activities COSIC is headed by Prof. Bart Preneel and Prof. Joos Vandewalle. More about the people at COSIC. COSIC's current research and projects COSIC's publications from 1982 until 2004. COSIC's (Master) thesis proposals and a list of the past Master theses COSIC organizes biweekly seminars on various topics. COSIC organizes bi-annually an International Course on the State of the Art and Evolution of Computer Security and Industrial Cryptography . The last two editions were held June 3-6, 2003 , and June 5-8, 2001 Leuven Security Excellence Consortium L-SEC has been formed in February 2002 by 8 founding members: Banksys, Cryptomathic, DATA4s, HyperTrust, K.U.Leuven, Telindus, Ubizen and Utimaco Safeware. The sponsoring member is PricewaterhouseCoopers. Upcoming Events: Fri 7/10/2005 Academy Contact Forum "Coding theory and cryptography" Paleis der Academiën, Hertogsstraat 1, B-1000 Brussel

108. Robotics And Computer Vision Home Page University of Illinois group based at the Beckman Institute. Specializes in robot vision technologies such as curved object recognition and structure from motion algorithms. http://www-cvr.ai.uiuc.edu/

Robotics and Computer Vision Laboratory Beckman Institute, University of Illinois Groups Professor Seth Hutchinson's Research Group Professor Jean Ponce's Research Group Professor Narendra Ahuja's Research Group Related University of Illinois Links The Beckman Institute The Department of Computer Science The Department of Electrical and Computer Engineering University of Illinois

109. Electric Algorithms, Inc. Home Page Provides custom software for embedded systems, programmable devices, simulators, HMIs, and computer graphics rendering engines. http://www.electric-algorithms.com/

Electric Algorithms, Inc. provides engineering consulting in these areas: sensors and control systems for exhibits and trade shows embedded systems programmable hardware devices instrument, actuator and system simulators ... Windows Multimedia Applications

110. Cellmatrix Core Page Publications describe an application of their computer architecture to genetic algorithms. Software includes an online circuit simulator. http://www.cellmatrix.com/entryway/entryway/core.html

Challenge: build your own circuit. introduction technology pages user pages ... exit "street signs, Hong Kong " L. Durbeck, 6/87, photograph

111. MaximAlgorithms.com Portfolio and Resume. algorithms and C code in computer science and mathematics, cryptology. Family, photos albums, popular quotes, thoughts. Links. http://www.maximalgorithms.com/

Go to... Home About Us Promotions Contacts ::Services:: Linux IT Consulting Software Development Web Design Email Support Main Home About Us Promotions Free Quote ... Contacts Services Linux IT Consulting Software Development Web Design Email support Misc. Password Generator PHP Setup Tutorial Popular Quotes Search WWW Search maximalgorithms.com MaximAlgorithms.com :: Home MaximAlgorithms Technologies is a software development and IT consultant company located in Ontario, Canada. Our goal is to provide first-class services to help our clients maximize their business performance by integrating strategic changes with the latest technologies. We will help your company grow on the Internet! We specialize in software development (Database-driven and Enterprise Web Applications, Standard Applications on Linux and Windows), and Linux Migration . We take customer satisfaction as our first priority! For more information about our services, please feel free to use our Online Evaluation Form or to e-mail us at: sales@maximalgorithms.com

112. Algolib: The Algorithms Project's Library And Other Packages Of The Algorithms P Combinatorial analysis, discrete mathematics and computer algebra are the main interests of the algorithms Projects. The packages let you define combinatorial structures; manipulate the associated generating functions, functional equations or recurrences; study their asymptotic behaviour. http://algo.inria.fr/libraries/software.html

Algolib: The Algorithms Project's Library and Other Packages of the Algorithms Project Welcome! Research Topics People Publications ... Extensive Example Sessions Combinatorics meets computer algebra! Combinatorial analysis, discrete mathematics and computer algebra are the main interests of the Algorithms Project. Our packages let you specify, generate, and enumerate combinatorial structures; manipulate the associated generating functions, functional equations or recurrences; study their asymptotic behaviour. The interplay between these applications serves the Algorithms Project's main goal of the automatic complexity analysis of algorithms. However, long-term research in this direction has induced the development of other packages for the manipulation of linear differential and difference operators, Groebner basis calculations, and the symbolic summation and integration of special functions and combinatorial sequences. Special emanations of the above are the algolib library , which collects most of our programs in a single archive, and the encyclopedia of combinatorial structures , which allows access by keywords, combinatorial specifications, generating function, closed-form or by the first integers in the enumeration sequence to many combinatorial structures. A lot of it was automatically generated using

113. 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.

114. Complexity Of Algorithms, Contents A list of topics from a computer Science course involving complexity of algorithms. HTML and PS format. http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html

Complexity of Algorithms (Topic outline) Models of computation Finite automata Turing machines Random Access Machines ... The power of machines: algorithmic decidability 2.1 Regular languages Recursive and recursively enumerable languages Other algorithmically undecidable problems Logically undecidable problems Exercises ... Time and space: general complexity theory Exercises Non-deterministic algorithms Non-deterministic Turing machines The complexity of non-deterministic algorithms Languages in NP ... Pseudo-random numbers 8.1 Classical methods Pseudo-random numbers One-way functions Exercises 9. Parallel algorithms 8.1 Parallel random access machines 8.2 The class NC Exercises 10. Decision trees 9.1 Algorithms decision trees: sorting and searching 9.2 Non-deterministic decision trees 9.3 Lower bounds on the depth of decision trees Exercises 11. Communication complexity 10.1 Communicaton matrix and protocol-tree 10.2 Non-deterministic communication complexity 10.3 Randomized protocols Exercises 12. The complexity of algebraic computations

115. Computer Program For Polyphasic Taxonomy Analysis The proBiosys suite of programs compares phenetic, chemotaxonomic and nucleic acid sequence data. algorithms for polyphasic taxonomy are available to construct Dendrograms, the suite is simple to use. http://www.proBiosys.com

116. Quantum Computer Emulator (QCE) A Windows based simulator of quantum computer hardware. Provides an environment to execute quantum algorithms under realistic experimental conditions. http://rugth30.phys.rug.nl/compphys0/qce.htm

Computational Physics Quantum Computer Emulator (QCE) Do wnload QCE (Version 8.1.1, 27 June 2004) Differences between Version 8.1.1 and 8.1.0 (see also QCE HELP Add document revqcs3.pdf . This review paper gives a survey of numerical algorithms and software to simulate quantum computers. It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation software for ideal and physical models of quantum computers. Correct mistakes in the Quantum Fourier Transform example. QCE users guide QCE HELP Links to related software products: QCAD is a total environment for Quantum Computing Simulation which helps you design, draw and simulate circuits. PowerPoint presentations QCE is a software tool that emulates various hardware designs of Quantum Computers. QCE simulates the physical processes that govern the operation of a hardware quantum processor, strictly according to the laws of quantum mechanics. QCE also provides an environment to debug and execute quantum algorithms under realistic experimental conditions. The software consists of a Graphical User Interface and the simulator itself. A few snapshots of the GUI are shown below: The software is distributed as a self-extracting executable for Windows 98/NT4/2000/ME/(XP with SP1). It also runs under Linux+VMware on Intel processor machines. Included in this package are several examples including Shor's algorithm for factoring integers, order finding, number partitioning, the Quantum Fourier transform, various implementations of the Deutsch-Josza algorithm and Grover's database search on ideal and more realistic QC's, such as those used in the 2-qubit NMR Quantum Computer. Articles describing the internal working of the QCE and the examples are also included.

117. 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

118. 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

119. UCSD Department Of Computer Science And Engineering - Algorithms And Data Struct UCSD Department of computer Science and Engineering. http://www.cse.ucsd.edu/gradedu/advising/exams/masterscompexam/algorithmsanddata

Degree Programs Admissions Courses Advising ... CSE Comp Exam for Master Students Algorithms and Data Structures Comprehensive Examination Syllabus Syllabus General Search Methods: Review of Depth First Search and Breadth First Search; Back-track search; branch-and-bound. Basic Strategies: Greedy algorithms; divide-and-conquer; dynamic programming; randomized algorithms. Basic Graph Problems: Shortest Path; Minimum Spanning Tree; Connectivity; Biconnectivity; Strong Connectivity; Transitive Closure; Augmenting Path algorithms (bipartite mathching, network flow, minimum cut problems) Sorting, Searching and Selection: Binary Search; Basic sorting algorithms (insertion sort, merge sort, quick sort, heap sort, radix sort); Linear time selection; Lower bound techniques (decision trees and adversary arguments) Algebraic Problems: Greatest Common Divisor; Matrix Multiplication; Polynomial Evaluation; Fast Fourier Transform and applications. Background Material Data Structures: linked lists, heaps, binary search trees, hash tables, B-trees, disjoint set union-find. Elementary Discrete Mathematics: Basic enumeration and probability, recurrence relations, basic definitions concerning sets, relations and functions.

120. CUHK Department Of Computer Science And 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/

Undergraduate Programme Postgraduate Programme M.Sc. in CS (Part-time) CS Minor Programme ... Other Links Professor Andrew Chi-chih Yao, world-renowned computer scientist, has joined our Department as Distinguished Professor-at-Large. Prof. Yao is the only Chinese being awarded the prestigious Turing Award which is regarded as the Nobel Price of Computer Science. ... more ... §ó¦h Sep 24, 2005 9:00am-5:30pm ¥»¬ì¤J¾Ç¸ê°T¤é Orientation Day for Undergraduate Admissions Sep 13, 2005 Seminar: The Rules of Modelling Automatic Generation of Constraint Programs Sep 5, 2005 CUHK Engineering Faculty CSE Webmail Privacy ... Sitemap Department of Computer Science and Engineering, The Chinese University of Hong Kong. Email: Tel: Fax: dept@cse.cuhk.edu.hk

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