Geometry.Net - Basic_C: Computer Algorithms


Home - Basic_C - Computer Algorithms

e99.com Bookstore

Images

Newsgroups

81-100 of 102 Back | 1 | 2 | 3 | 4 | 5 | 6 | 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)

Elementary Functions: Algorithms and Implementation by Jean-Michel Muller, 2005-10-24
Biologically Inspired Algorithms for Financial Modelling (Natural Computing Series) by Anthony Brabazon, Michael O'Neill, 2009-12-15
Introduction to Computing and Algorithms by Russel L Shackelford, 1997-10-26
Data Structures and Algorithms with Object-Oriented Design Patterns in C++ by Bruno R. Preiss, 1998-08-31
Verification of Reactive Systems: Formal Methods and Algorithms (Texts in Theoretical Computer Science. An EATCS Series) by Klaus Schneider, 2010-11-02
Selected Papers on Design of Algorithms (Center for the Study of Language and Information - Lecture Notes) by Donald E. Knuth, 2010-04-15
Rational Algebraic Curves: A Computer Algebra Approach (Algorithms and Computation in Mathematics) by J. Rafael Sendra, Franz Winkler, et all 2007-11-08
Problem Solving With Algorithms And Data Structures Using Python by Bradley N. Miller, David L. Ranum, 2005-09
Digital Video and HDTV: Algorithms and Interfaces (The Morgan Kaufmann Series in Computer Graphics) by Charles Poynton, 2002-12-30
Design and Modeling for Computer Experiments (Chapman & Hall/CRC Computer Science & Data Analysis) by Kai-Tai Fang, Runze Li, et all 2005-10-14
Combinatorial Algorithms for Computers and Calculators (Computer science and applied mathematics) by Albert Nijenhuis, 1978-06
Introduction to Distributed Algorithms by Gerard Tel, 2001-02-15
Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (Lecture Notes in Computer Science)
Curves and Surfaces in Geometric Modeling: Theory & Algorithms (The Morgan Kaufmann Series in Computer Graphics) by Jean Gallier, 1999-10-21

lists with details

Computer Algorithms
From the Publisher This edition features an increased emphasis on algorithm design techniques such as divideand-conquer and greedy algorithms, along with the addition of new
http://portal.acm.org/citation.cfm?id=540008
Avideh Zakhor's Home Page
Professor at Berkeley. Image and video compression.
http://www-video.eecs.berkeley.edu/~avz/

Extractions: Email: avz at eecs dot berkeley dot edu Affiliations: 3D Image Processing and Computer Vision Airborne and Terrestrial 3D, Photorealistic Modeling of Urban Environment 3D Photorealistic Airborne Only Modeling; download models here Aerial Lidar Classification of Urban Landscape 3D Modeling of Building Interiors Estimating floor-plans of buildings from the exterior; Videos of buildings: 4D Scene Modeling and Reconstruction of Moving Objects: video Related Publications Wireless Networking Local Estimation of Collision Probabilities in 802.11 WLANs with Hidden Terminals Quality of Service Issues in Wide Area and Local Area Networks A Uniform Two Timescale Framework for Flow Control in Wireless Networks Path Selection for Video Streaming over Wireless Ad Hoc Networks ... Related Publications Application of Image Processing to Integrated Circuit Lithography Optical Proximity Correction Algorithms Layout Compression for Direct Write Lithography Systems Related Publications Multimedia Search and Retrieval Related Publications Multimedia Networking and Communication Related Publications Image and Video Compression Related Publications EE290T, 3D computer vision and image processing, Fall 2009 Web page
Aria's Home Page
(old student pages)
http://www.utdallas.edu/~aria/dance/index_old.html

Extractions: Ph.D. candidate in Electrical Engineering at the University of Illinois at Urbana-Champaign . I am affiliated with the Image Laboratory in the Beckman Institute for Advanced Science and Technology , and also the Coordinated Science Laboratory I am now also affiliated with the Information Sciences and Systems group of the Electrical Engineering Department at Princeton University , where I spend most of my time doing research in Advanced Image Processing Laboratory I will shortly join Rice University as a visiting assistant professor. I invite you to visit my new home page at Rice University. Video Coding
Stanford University Professor - Robert M. Gray
Vector quantization for signal compression and classification.
http://ee.stanford.edu/~gray/

Extractions: Short Bio Full CV Full publications list Linear Predictive Coding and the Internet Protocol , Parts I and II: http://dx.doi.org/10.1561/2000000029 and http://dx.doi.org/10.1561/2000000036 See also "Early LPC History and the origins of VoIP" Talk slides and related links on the Pacific rim portion of the history of the development of LPC and the first successful documented packet speech experiments on the ARPA net thirty years ago. Banff International Research Station Workshop on Mentoring for Engineering Academia II , 22 - 27 July 2007.
Sergio Verdu Website
Rate-distortion theory, source coding. Professor at Princeton.
http://www.princeton.edu/~verdu/
Random Number Generators - The PLab Project - Literature
A guide to the literature.
http://random.mat.sbg.ac.at/literature/

Extractions: In the context of stochastic simulation (i.e. Monte Carlo methods), the current state of the art in random number generation is reflected in the proceedings of the Monte Carlo and Quasi-Monte Carlo (MCQMC) conferences, see the website www.mcqmc.org . The latest issues in this series of proceedings are Fang, K.-T., Hickernell, F.J., and Niederreiter, H. (editor): Monte Carlo and Quasi-Monte Carlo Methods 2000 . Springer-Verlag, New York, 2002. Niederreiter, H. and Spanier, J. (editor): Monte Carlo and Quasi-Monte Carlo Methods 1998 . Springer-Verlag, New York, 2000. Knuth, D.E.: The Art of Computer Programming, volume 2 : Seminumerical Algorithms. Addison-Wesley, Reading, MA, 3rd edition, 1997. Knuth's book is extremely rich in information but requires good knowledge of mathematics, in particular number theory. I would not recommend this book as first reading for practitioners. The following monograph contains a comprehensive discussion of the theoretical assessment of random number generators and a valuable list of references. Readers should be prepared for a text in pure mathematics, in particular number theory and algebra (theory of finite fields).
Frandom: Fast And Entropy Saving Random Number Generation For The Linux Kernel
Fast RNG for the Linux kernel. A sourceforge project.
http://www.billauer.co.il/frandom.html

Extractions: The frandom suite comes as a Linux kernel module for several kernels, or a kernel patch for 2.4.22. It implements a random number generator, which is 10-50 times faster than what you get from Linux' built-in /dev/urandom. And it uses very little ( /dev/frandom ) or none ( /dev/erandom ) of the kernel's entropy pool, so it is very useful for applications that require a handy source for lots of random data. An example when this is useful is in the Hardened Linux From Scratch (hlfs) , where small chunks of random data are needed very often. There were two reasons why I wrote this module: First, I wanted to try writing for the kernel for a long time. Unfortunately, I couldn't find anything interesting to write: Everything had been done, and all drivers were working well on my hardware. And then I attended a lecture by Oleg Goldshmidt at Haifux, the Haifa Linux Club . This lecture dealt with pseudo-number generation. One of the points in the lecture was that /dev/urandom was a good random number generator, but it was slow. It so happened that I had recently implemented the RC4 crypto algorithm for one of my clients, so I was familiar with the algorithm and how simple it was. After searching in the web, I found that some people actually
Michael Hansmeyer
Features profile and experiments in computational and algorithmic architecture.
http://www.michael-hansmeyer.com
Erik Demaine
Combinatorics, theory of computation and algorithms.
http://theory.lcs.mit.edu/~edemaine/

Extractions: Massachusetts Institute of Technology Papers Sculpture Videos Puzzles ... Software Movies: I appear in the documentaries Between The Folds about origami (which you can watch online ) and The Man Who Saved Geometry about Coxeter (which you can watch online in Canada CV in PostScript or PDF , last updated on September 9, 2010. I co-edit The Open Problems Project with Joseph Mitchell and Joseph O'Rourke I am interested in most areas of research in mathematics and computer science broadly connected to algorithms. Particular interests include Discrete and computational geometry: Folding and unfolding linkages , robotics, motion planning, dissections, simple polygonizations Data structures: Dynamic data structures, succinct encodings of data structures, memory management, cache-efficient and disk-efficient data structures, average-case data structures, text indexing
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/

Extractions: ACM Special Interest Group on Algorithms and Computation Theory Our Organization The Association for Computing Machinery Institutional Sponsors SIGACT is an international organization that fosters and promotes the discovery and dissemination of high quality research in theoretical computer science (TCS), the formal analysis of efficient computation and computational processes. SIGACT, through its awards program, recognizes individuals who have made significant contributions to the field in research and service. TCS covers a wide variety of topics including algorithms, data structures, computational complexity, parallel and distributed computation, probabilistic computation, quantum computation, automata theory, information theory, cryptography, program semantics and verification, machine learning, computational biology, computational economics, computational geometry, and computational number theory and algebra. Work in this field is often distinguished by its emphasis on mathematical technique and rigor. Information on joining SIGACT is available here . Membership benefits include: Designed and maintained by Amit Chakrabarti Latest update: Thu Sep 23 14:56:58 EDT 2010
Dictionary Of Algorithms And Data Structures
A dictionary of algorithms, algorithmic techniques, data structures, and archetypical problems, with related definitions. Many entries have links to implementations, tutorials, and bibliographical references.
http://www.nist.gov/dads/

Extractions: This web site is hosted in part by the Software and Systems Division Information Technology Laboratory This is a dictionary of algorithms, algorithmic techniques, data structures, archetypal problems, and related definitions. Algorithms include common functions, such as Ackermann's function . Problems include traveling salesman and Byzantine generals . Some entries have links to implementations and more information. Index pages list entries by area and by type . The two-level index has a total download 1/20 as big as this page. Don't use this site to cheat. Teachers, contact us if we can help. To define or correct terms, please contact Paul E. Black . We do not include algorithms particular to business data processing, communications, operating systems or distributed algorithms, programming languages, AI, graphics, or numerical analysis: it is tough enough covering "general" algorithms and data structures. Some terms with a leading variable, such as n -way, m -dimensional, or
The Stony Brook Algorithm Repository
This is a collection of implementations for 75 fundamental algorithms problems, including data structures, numerical and combinatorial algorithms,graph algorithms, and computational geometry. Implementations are available in C++, Java, Fortran, and other languages.
http://www.cs.sunysb.edu/~algorith/

Extractions: Stony Brook University ... Graduate Study Opportuinties This WWW page is intended to serve as a comprehensive collection of algorithm implementations for over seventy of the most fundamental problems in combinatorial algorithms. The problem taxonomy, implementations, and supporting material are all drawn from my book The Algorithm Design Manual . Since the practical person is more often looking for a program than an algorithm, we provide pointers to solid implementations of useful algorithms, when they are available. Because of the volatility of the WWW, we provide local copies for many of the implementations. We encourage you to get them from the original sites instead of Stony Brook, because the version on the original site is more likely to be maintained. Further, there are often supporting files and documentation which we did not copy, and which may be of interest to you. The local copies of large implementations are maintained as gzip tar archives and, where available, DOS zip archives. Software for decoding these formats is readily available Many of these codes have been made available for research or educational use, although commercial use requires a licensing arrangement with the author. Licensing terms from academic institutions are usually surprisingly modest. The recognition that industry is using a particular code is important to the authors, often more important than the money. This can lead to enhanced support or future releases of the software. Do the right thing and get a license information about terms or who to contact is usually available embedded within the documentation, or available at the original source site.
On The Road To Algorithms
Information on algorithms such as Bubble Sort and Random Number Generation, using HTML, Java and Perl. Collected by Lam Ka Chun (Raymond).
http://www.hlcmklam.com/
Algorithm Design Paradigms
A course by Paul Dunne at the University of Liverpool. Slides and notes in HTML and PS.
http://www.csc.liv.ac.uk/~ped/teachadmin/algor/algor.html
Algorithms And Data Structures Tutorials And Lecture Notes
Algorithms lecture notes, courses, tutorials, references, guides and online books.
http://www.oopweb.com/Algorithms/Files/Algorithms.html
The Algorithm Base, Papers, Intelligence United: Algorithm Base,Papers,Tutorials
Database of algorithms. May be scanned through or can be questioned through a knowledge based assistant. Links to originating web sites.
http://www.intelligenceunited.com/index2.html

Extractions: Home About ContactUs Subscribe by RSS ... Feature October 23rd, 2010 An algorithm is a mathematical formula that solves a problem. Applied to the search engines, algorithms are used for once given a numerical value to certain factors (such as the importance of a page, often citing a word, where is located the word in the context of the page, etc.). , finding a numerical outcome [...] No Comments admin Algorithm animation ... Feature October 2nd, 2010 Catai is an algorithm animation system that relies on the
Priority Queues
Electronic bibliography on priority queues (heaps). Links to downloadable reports, researchers home pages, and software.
http://www.leekillough.com/heaps/
Analysis Of Algorithms
An initiative of attendees of the 1997 Dagstuhl seminar, these pages provide research papers, a bulletin board, and links to researchers and other resources in the field. The focus is on average case and probabilistic analysis.
http://algo.inria.fr/AofA/

Extractions: Helmut Prodinger , Johannesburg Research Problems Bulletin board People ... North American Mirror A nalysis of Algorithms (AofA) is a field in computer science whose overall goal is an understanding of the complexity of algorithms. While an extremely large amount of research is devoted to worst-case evaluations, the focus in these pages is methods for average-case and probabilistic analysis. Properties of random strings, permutations, trees, and graphs are thus essential ingredients in the analysis of algorithms. T he subject was founded by Knuth (who coined the term "analysis of algorithms" in the mid-sixties) and is well illustrated by his monumental series, The Art of Computer Programming The field entertains close ties with a number of areas like discrete mathematics, combinatorial analysis, probability theory, analytic number theory, asymptotic analysis, complexity theory, and sometimes statistical physics. l T hese pages are the initiative of a bunch of people who gathered at a meeting specifically devoted to AofA, in
Stack Free Recursion
A paper describing the Stack Free Recursion algorithm. C code with C++ comments.
http://www.olympus.net/personal/7seas/recurse.html

Extractions: C)opyright 1995, Otto J. A. Smith (206) 385-1956 otto@olympus.net Abstract: A method of building recursive functions in systems that don't have a data stack is presented. We illustrate its use with a factorial function, the towers of hanoi puzzle and a recursive line drawing routine which we believe is presented here for the first time. We reduce beautiful recursive code to unintelligible spaghetti code that uses less memory and sometimes is faster. This method may speed up simple functions but mostly it helps us to understand the nature of recursion and provides a method of deriving code. We also present a method that uses no return stack or data stack and we derive a simple line drawing function using the information presented herein. All of the code presented here is available by anonymous ftp from olympus.net in pub/sites/7seas under the name recurse.cpp Introduction: In the mid seventies I was working on the MicroData Reality computer and operating system. This sported what would now be considered a primitive BASIC, but at that time was relatively sophisticated. It was a compiled BASIC and like many BASICs both then and now, it did not support recursive function calls. In that system it was possible for a routine to call itself but all variables passed were global because there was no data stack in the system. I mentioned casually to a fellow system analyst that it was easy to write a factorial routine recursively on the system without emulating a data stack. He expressed doubt that this was possible. I won a fifty cent bet with the following routine. The following routine does depend on there being a return stack in the system. Since assembly language systems provide return stacks, this kind of routine works well in assembly language. The following routine is written in C code with C++ comments. We do not pass a parameter to the factorial routine, we set the parameter
Data Structures By R. K. Ghosh
Course materials, animation applets, links to on-line books and other related internet resources.
http://www.cse.iitk.ac.in/users/dsrkg/cs210/

Extractions: [26 November, 2002] Grading is complete. Those who may like to review the grading scheduled can do so by today by 5.00pm latest. [26 November, 2002] Request for regrading will be entertained according to a slightly modifified policy [21 November, 2002] Solutions for endsem exam have been posted Check out the Notice Board for previous announcements.

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

81-100 of 102 Back | 1 | 2 | 3 | 4 | 5 | 6 | Next 20