Geometry.Net - the online learning center
Home  - Basic_C - Computer Algorithms
e99.com Bookstore
  
Images 
Newsgroups
Page 9     161-180 of 183    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | 10  | Next 20
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  

         Computer Algorithms:     more books (100)
  1. Computer Algorithms by Ellis Horowitz, Sartaj Sahni, et all 2007-11
  2. The Design and Analysis of Computer Algorithms (Addison-Wesley Series in Computer Science and Information Processing) by Alfred V. Aho, John E. Hopcroft, et all 1974-01-11
  3. Computer Algorithms: Introduction to Design and Analysis (3rd Edition) by Sara Baase, Allen Van Gelder, 1999-11-15
  4. Computer Animation, Second Edition: Algorithms and Techniques (The Morgan Kaufmann Series in Computer Graphics) (The Morgan Kaufmann Series in Computer Graphics) by Rick Parent, 2007-10-01
  5. Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr) by Alfred V. Aho, Jeffrey D. Ullman, et all 1983-01-11
  6. Computer Algorithms C++: C++ and Pseudocode Versions by Ellis Horowitz, Sartaj Sahni, et all 1996-12-15
  7. Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition) (Art of Computer Programming Volume 1) by Donald E. Knuth, 1997-07-17
  8. Computer Graphics and Geometric Modelling: Implementation & Algorithms by Max K. Agoston, 2005-01-04
  9. Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition) (Art of Computer Programming Volume 2) by Donald E. Knuth, 1997-11-14
  10. Computer Arithmetic Algorithms by Israel Koren, 2001-12-15
  11. Algorithms for Image Processing and Computer Vision by J. R. Parker, 1996-11-25
  12. The Design and Analysis of Algorithms (Monographs in Computer Science) by Dexter C. Kozen, 1991-12-03
  13. Algorithms Sequential & Parallel: A Unified Approach (Electrical and Computer Engineering Series) by Russ Miller, Laurence Boxer, 2005-08-03
  14. Algorithms & Data Structures: The Science Of Computing (Electrical and Computer Engineering Series) by Douglas Baldwin, Greg Scragg, 2004-06

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

162. Welcome To The Turnbull Server
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/
T URNBULL WWW S ERVER
School of Mathematical and Computational Sciences
University of St Andrews Welcome
to the T URNBULL world wide web server, named after the mathematician Herbert Westren Turnbull (1885-1961) who was the Regius Professor of Mathematics at the University of St Andrews from 1921 to 1950. To find out more about Turnbull you can read his biography T URNBULL is run by the School of Mathematics and Statistics at the University of St Andrews , St Andrews, Fife, Scotland. T URNBULL is the home of the award-winning MacTutor History of Mathematics Archive an integrated collection of over 1000 biographies and historical articles of a mathematical nature, alongside interactive birthplace maps and the famous curve applet. To visit the archive click on the logo, name or here The web pages for the computer algebra system GAP are now on http://www-gap.dcs.st-and.ac.uk/~gap . Information about ISSAC 2000 is at http://www-gap.dcs.st-and.ac.uk/issac2000 Server statistics for T URNBULL can be found here BS. File /home.turnbull/httpd/html/index.html

163. Parallel Worlds - Software Development Company. Home Page
Company develops algorithms and software for Image Processing, computer Geometry, Vectoring, compression successfully used for satellite, bio medical, GIS, mapping and CAD/CAM applications.
http://www.pworlds.com/
Site Builder Workshop Your browser does not support frames, so this page, which is part of the Site Builder Workshop, does not include site navigation features. If you use a frame-capable browser, such as Microsoft Internet Explorer version 3.0 or later or , you'll have a much more pleasant experience navigating around this site.

164. Alex Vinokur ### Comp. Sci. & Math. Page
Programs and algorithms, computer Science, Software Engineering, Databases in C, C++, STL, Pro*C/C++
http://alexvn.freeservers.com/s1/alexvn.html

Free Web site hosting - Freeservers.com
Web Hosting - GlobalServers.com Choose an ISP NetZero High Speed Internet ... Dial up $14.95 or NetZero Internet Service $9.95
Alex Vinokur
Programs, Algorithms, Discussions ...
Professional WebRings
eMailcat

165. Site Move - Artifical Intelligence
Chess, computer chess, programming, algorithms, AI, and connect 4. Free download of source code and games.
http://users.pandora.be/ai/
Please note that the site has moved. Please go to the following site: http://users.telenet.be/artificialintelligence if you do not get redirected automatically. Please update your bookmarks.

166. Zabrodsky, Vladimir
algorithms, Rexx, computer security and optical illusions.
http://www.geocities.com/SiliconValley/Garage/3323/
VLADIMIR
ZABRODSKY
I was born on the first of July 1956. I have a degree in Computer science from Brno Masaryk's University in 1980. I have been married to my wife Bohumila for fourteen years. We have one son Vladimir. We live in Blansko, near Brno, in the Czech Republic. Blansko is the center of mysterious Moravian Karst. I am the author of MODIFIND algorithm. It was included by Paul E. Black into the dictionary: Algorithms, Data Structures, and Problems Terms, and Definitions of the CRC Dictionary of Computer Science, Engineering, and Technology. My name is mentioned in the list of contributors of the book Laplante, P. A. et al.: Dictionary of Computer Science, Engineering, and Technology, CRC Press LLC, 2001 (see photo and link below). This homepage includes my articles on with Album of Algorithms and Techniques, beautiful apple snails, theory of identification and authentication, and more: I prepared Animated Optical Illusions page where my animated gifs show famous optical illusions. 7 March 2001 - My site has been chosen to receive the Golden Web Award from 10 most popular articles

167. MathInfo2002
Colloquium on Mathematics and computer Science algorithms, Trees, Combinatorics and Probabilities. Universit© de Versailles, France; 1619 September 2002.
http://www.prism.uvsq.fr/MathInfo2002/
Colloquium on Mathematics and Computer Science :
Algorithms, Trees, Combinatorics and Probabilities
September 16-19, 2002
45, avenue des Etats-Unis
78035 Versailles cedex - France
The third Colloquium on Mathematics and Computer Science will take place in Vienna (Austria) on September 13-17, 2004.

Welcome to the home page of the Second International Colloquium on Mathematics and Computer Science.
On this site you will find the following informations : Photo album of the colloquium Problems presented at the open problems session ( postscript file here) Scientific program How to get there Social program Learn here about the town of Versailles , including its history and famous castle Scientific committee Scope Organizing committee ... Invited speakers email : mathinfo@prism.uvsq.fr Registration Some hotels in Paris and Versailles Sponsors

168. Viruses, Anti-viruses, Events, Facts And Commentary
Permanently replenishing information about new viruses. Mechanisms of breeding and operation, detailed analysis of algorithms of viruses. Methods to guard against computer viruses.
http://www.viruslist.com
select section: news calendar encyclopedia language: russian english
Last update: 06/08/2004
News Topics All News Viruses[689] Hackers[128] Vulnerabilities[95] Spam[16] ... Other news[384] Most Popular This week's most read items Virus Top Twenty for May 2004 [news] I-Worm.Plexus.a [viruses] ... Click for more
VL-Finder
Virus-News Mailing List!

Join Right Now!
Click here to bookmark!
Virus Alert
I-Worm.Plexus.b
[ 06/06/2004 11:59, GMT +03:00, Moscow ]
Danger: moderate risk
Kaspersky Labs has detected a new variant of I-Worm.Plexus.a
Kaspersky Anti-Virus Database Updates
Detailed description of I-Worm.Plexus.b I-Worm.Plexus.a [ 06/03/2004 11:00, GMT +03:00, Moscow ] Danger: moderate risk Kaspersky Labs has detected a new Internet worm, I-Worm.Plexus.a. It spreads via local networks and the Internet as an attachment to infected emails, via file-sharing networks, and also via the LSASS and RPC DCOM vulnerabilities in MS Windows. Kaspersky Anti-Virus Databases Updates Detailed description of Plexus All News Virus Top Twenty for May 2004 Kaspersky Labs presents the Virus Top 20 ... The month that shook the world Virus writers arrested worldwide, but new virus for Win64 does not bode well

169. Quentin Stout Homepage
University of Michigan computer science professor with research in parallel computing, algorithms, scientific and statistical computing, and discrete mathematics.
http://www.eecs.umich.edu/~qstout/
Quentin F. Stout
Affiliations Research Interests, Projects, Publications
Research
My students and I work in scientific computing and computational science adaptive sampling designs and clinical trials parallel computing ; and algorithms and data structures.

170. Bhujade, Moreshwar
Indian Institute of Technology, Bombay computer Architecture and Operating systems, Fault tolerent Distributed algorithms, Neural networks, Speech/Image Processing, Speech technology for Indian languages
http://www.cse.iitb.ernet.in/~mrb/

171. Prof. Frank Dehne - Www.scs.carleton.ca/~dehne
School of computer Science, Carleton University Parallel Computing, Coarse Grained Parallel algorithms, Parallel Data Mining and OLAP, Computational Geometry, Image Processing
http://www.scs.carleton.ca/~dehne/

172. Personal Page Of Martin Held
University of Salzburg Computational geometry, computer graphics, program design, algorithms and data structures, computer-aided design and manufacturing.
http://www.cosy.sbg.ac.at/~held/held.html
me address how to reach my office research interests ... Internet campaigns
Martin Held
AMS Dept. of the State University of New York at Stony Brook, Stony Brook, USA; see the homepage of the Computational Geometry Lab at SUNYSB.
Address
snail mail

FB Scientific Computing

Jakob-Haringer Str. 2

A-5020
Salzburg ...
Austria
e-mail
held@cosy.sbg.ac.at
phone
fax
How to Reach My Office
Please see my WWW page on driving directions and maps
Research Interests
  • Computational Geometry and Computer Graphics
  • Program Design, Algorithms and Data Structures
  • Computer-Aided Design and Manufacturing
Research Projects
I have recently started to assemble a few pages with short descriptions of (or color images related to) some of the application-oriented research projects which I have (or had been) working on. This WWW presentation of current and previous research projects is work in progress; please bear with me (and check back to see whether I've already gotten around to adding new stuff).
Courses and Office Hours
Local students are invited to browse through a few announcements related to my teaching . (Folks, be warned that some of these pages are in German!).

173. Piyush Kumar's Homepage
Indian Institute of Technology Undergraduate, especially interested in computational geometry, computer graphics and algorithms.
http://geomwiz.tripod.com
var cm_role = "live" var cm_host = "tripod.lycos.com" var cm_taxid = "/memberembedded" Check out the NEW Hotbot Tell me when this page is updated
Piyush Kumar
Moved to Piyush Kumar's Home Page

174. Untitled
A masters student in computer Science department of SUNY at Stony Brook. Wireless LAN, Analysis of algorithms, Analysis and synthesis of networks curse descriptions, paper list and links.
http://www.cs.sunysb.edu/~salil/
You will be forwarded in 2 seconds If your browser does not support auto forwarding then please go away naah just kidding, you can click here

175. GRAIL: Tilings And Geometric Ornament
Applying principles of computer graphics to the creation of geometric ornament, as a continuation of the tradition of ornamental design using modern tools and algorithms.
http://www.cs.washington.edu/homes/csk/tile/
University of Washington Department of Computer Science and Engineering GRAIL Projects Tilings and Geometric Ornament Introduction The goal of this project is to explore the relationship between computer graphics, geometry, and ornamental design. Each of these three subjects has been studied extensively on its own. Even the pairwise intersections have been fairly well-traveled. But there is lots of room for exploration in the intersection of all three. We view this research as an attempt to apply principles of computer graphics to the creation of geometric ornament, as a continuation of the tradition of ornamental design using modern tools and algorithms. It's exciting to know that people out there are reading this page and finding it interesting. But it's also a serious wake-up call! Exposure makes me think about how much more information I'd love to put up here if I had the time. In the meantime, if you have questions, or even requests for what else I should publish here, please get in touch Personnel Craig S. Kaplan

176. Combinatorics, Probability & Computing
Now published bimonthly, devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.
http://uk.cambridge.org/journals/cpc/
Home Journals
Features Related Journals
Journals By Title By Subject Highlights New Journals 2004 ... Advanced Search
Cambridge Alerts Free journal TOC alerts New title information alerts
Edited by Béla Bollobás
University of Memphis, USA
Editorial Board
Instructions for Contributors Advertising Rates Links
Aims and Scope
Now published bimonthly, is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.
Print ISSN: 0963-5483
Online ISSN: 1469-2163 Full pricing details Current volume: 13:1 - 13:6, 2004 All issues View a free sample of this journal Cambridge University Press 2004. North America: Order by phone 800-872-7423 (U.S. and Canada) 95-800-010-0200 (Mexico) or 914-937-9600, or by fax 914-937-4712.

177. Machine Learning In Games
How computers can learn to get better at playing games. This site is for artificial intelligence researchers and intrepid game programmers. I describe game programs and their workings; they rely on heuristic search algorithms, neural networks, genetic algorithms, temporal differences, and other methods.
http://satirist.org/learn-game/
Machine Learning in Games
How computers can learn to get better at playing games. This site is for artificial intelligence researchers and intrepid game programmers. I describe game programs and their workings; they rely on heuristic search algorithms, neural networks, genetic algorithms, temporal differences, and other methods. I keep big list of online research papers. And there's more. Jay game learning
The January 2002 issue of Artificial Intelligence is a special issue on "Games, Computers, and Artificial Intelligence", with overview papers on many top programs.
what's new
- updated 24 February
about these pages
- including acknowledgements
find stuff here
find stuff in the rest of the world
index of games mentioned on this site
index of
people mentioned on this site
tutorials
- get started with AI
artificial intelligence links
- the best entry points
game links
- about the games themselves
game AI stuff
- discussions, archives, etc.
learning projects and game-playing programs
Internet distributed learning - machine learning @ home
Metagame
- a game-definition framework
Morph
- an ambitious project that includes game learning robotic soccer - with both simulated and real robots the neural network backgammon programs the strong learning ... games - various papers Nici Schraudolph's go networks Sebastian Thrun's NeuroChess ... SAL - a game-learning system
methods
Here the emphasis is on the technique rather than the use it's put to.

178. Läraktiga Datoralgoritmer
Chalmers, computer Engineering Informationsansvarig Thorsteinn Rögnvaldsson, Kort användarinformation för denna server Senast uppdaterad 971001.
http://www.ce.chalmers.se/external/lardat/
Chalmers Computer Engineering
Informationsansvarig Kort
Senast uppdaterad 971001
  • Examinationsuppgifter WWW resurser
  • 179. Welcome To Mingsee
    Develops systems which enable computers to analyse and understand text by using proprietary algorithms.
    http://www.mingsee.com/

    Welcome to Mingsee
    We are under construction, please visit again soon!

    180. Sourcebank
    Current Directory Root. Applications (1714), Architecture (130), computer Science (2243). Databases (276), Distributed Object Architectures (48), Mathematics (1564).
    http://archive.devx.com/sourcebank/directorybrowse.asp?adType=

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

    free hit counter