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

82. Avideh Zakhor's Home Page Professor at Berkeley. Image and video compression. http://www-video.eecs.berkeley.edu/~avz/

Avideh Zakhor's Home Page Professor Office: 507 Cory Hall Phone: (510) 643-6777 Fax: (510) 642-2739 Email: avz at eecs dot berkeley dot edu Affiliations: Video and Image Processing Lab Wireless Foundations Connectivity Lab Biography ... Complete Publication List Research Projects 3D Image Processing and Computer Vision Airborne and Terrestrial 3D, Photorealistic Modeling of Urban Environment download 3D model of downtown Berkeley from here download interactive video of 3D model of downtown Berkeley from here 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 Courses EE290T, 3D computer vision and image processing, Fall 2009 Web page

83. Aria's Home Page (old student pages) http://www.utdallas.edu/~aria/dance/index_old.html

ARIA NOSRATINIA Status 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. Research Interests Video Coding Motion Estimation and Compensation Image Coding Medical Image Processing and Coding Published Articles You can look at and download some of these papers directly. If you are interested in any of the articles that aren't available here, send me e-mail at aria@ifp.uiuc.edu Curriculum Vitae: You can also look at my resume Other Interests Ice Skating Ice Dancing Classical Music Tennis Ballroom Dancing Recent developments in immigration legislation ... Free speech on internet and communications decency act Contact Information: At University of Illinois 2323 Beckaman Institute 405 N. Mathews Ave. Urbana, Illinois 61801 USA Tel: (217) 244-2960 FAX: (217) 244-8371

84. Stanford University Professor - Robert M. Gray Vector quantization for signal compression and classification. http://ee.stanford.edu/~gray/

Robert M. Gray Alcatel-Lucent Technologies Professor of Communications and Networking in the School of Engineering Professor of Electrical Engineering Faculty Affiliate, Michelle R. Clayman Institute for Gender Research rmgray at stanford.edu If you are renting an apartment in Paris, you might consider this warning based on our unfortunate experience and financial loss at the hands of the Paristay rental agency. Classes (2010-2011) Winter: EE 278 Short Bio Full CV Full publications list Various 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. Slides and photos Proceedings pdf or html Foundations and Trends in Signal Processing Proceedings of the June 2004 PAESMEM/Stanford Workshop on Mentoring in Engineering pdf or html Research Group Signal Compression and Classification Group Group Alumni/Alumnae Free Books (No warrantees included.)

85. Sergio Verdu Website Rate-distortion theory, source coding. Professor at Princeton. http://www.princeton.edu/~verdu/

Skip over navigation Library WebMail A to Z Lists ... Office of the President Quick Links SEAS Department of Electrical Eng. Campus Life Visiting Princeton Biography Curriculum Publications Teaching ... Applying to Princeton © 2005 The Trustees of Princeton University Last update: July 28, 2005

86. Random Number Generators - The PLab Project - Literature A guide to the literature. http://random.mat.sbg.ac.at/literature/

Home Contact Impressum About us ... Tests 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). As Knuth's book, Niederreiter's excellent monograph is an important reference in this field.

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

Home CV CV (hebrew) FPGA Editor ... Eobj frandom cdepend hitec (LaTeX) easyspec peakdet ... Tech blog frandom 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

88. Michael Hansmeyer Features profile and experiments in computational and algorithmic architecture. http://www.michael-hansmeyer.com

89. Erik Demaine Combinatorics, theory of computation and algorithms. http://theory.lcs.mit.edu/~edemaine/

[photo by Stefan Langerman] Computational Origami Martin Demaine , part of the Museum of Modern Art permanent collection Erik Demaine MacArthur Fellow Alfred P. Sloan Research Fellow Associate Professor of Electrical Engineering and Computer Science Member of the Computer Science and Artificial Intelligence Lab in the Theory of Computation group, specifically Algorithms Massachusetts Institute of Technology Research 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

90. 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 Special Interest Group on Algorithms and Computation Theory main conferences people prizes ... web pages Our Organization The Association for Computing Machinery Institutional Sponsors About SIGACT 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. Membership Information Information on joining SIGACT is available here . Membership benefits include: Subscription to SIGACT News Subscription to SIGACT News Online Reduced-rate registration for SIGACT sponsored conferences Individually mailed calls for papers and schedules for these conferences SIGACT Headlines Designed and maintained by Amit Chakrabarti Latest update: Thu Sep 23 14:56:58 EDT 2010

91. 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/

Dictionary of Algorithms and Data Structures 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

92. 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/

About the Book The Stony Brook Algorithm Repository Steven Skiena 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.

93. 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/

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

Algorithm Design Paradigms - Overview of Course Introduction Divide-and-Conquer Algorithms Dynamic Programming Algorithms The Greedy Method ... Postscript version of OHP slides (complete) (8 to a page) See also Computability and Complexity PED Home Page

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

Backtesting Trading Strategies and Automated Trading Platform - FREE Download Algorithms lecture notes, courses, tutorials, references, guides and online books. All of these are published at the Algorithms Directory , allowing quick access and accurate search. Algorithms Directory Lecture Notes Title Author Description Data Structures and Algorithms (No Frames) John Morris Sorting and Searching Algorithms (No Frames) Thomas Niemann A small guide on the following topics : Arrays, Linked Lists, Timing Estimates, Insertion sort, Shell sort, Quicksort, Hash Tables, Binary Search Trees, Red-Black Trees, Skip Lists, External Sorts, B-Trees.

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

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 Catai Description admin Algorithm animation ... Feature October 2nd, 2010 Catai is an algorithm animation system that relies on the distributed object technology. Catai makes possible to bring life to algorithms coded in the C++ programming language. Here are some of the main features of Catai: Object Oriented animation paradigm Animations made with Catai focus on the notion of animated data structure. Traditional animation systems often propose a procedural [...] No Comments Getting Started with PGP admin Feature ... PHP Programming September 28th, 2010 If you decide to use the PGP family of software, there are two parts to the puzzle: You need PGP on your Web server (to encrypt) and PGP on No Comments Java Script function can be fired upon completion of the move admin Feature ... JAVA September 25th, 2010

97. Priority Queues Electronic bibliography on priority queues (heaps). Links to downloadable reports, researchers home pages, and software. http://www.leekillough.com/heaps/

Priority Queues By Lee Killough If links are broken, please look here for papers . I have not had time to update links. Contents Introductory Material Priority Queue Starting Points Papers on Priority Queues Priority Queue Implementations ... Glossary Introductory Material Definitions of Algorithms, Data Structures, and Problems Definition of priority queue and related terms, in Paul Black's computer science glossary Heaps (Priority Queues) Ian Graham's lecture Heaps Stefan Xenos' survey of priority queues and their complexities Data Structures and Algorithms: Queues John Morris' notes on priority queues Data Structures Introduction to data structures, with Java code, by Peter M. Williams Heaps and Priority Queues Online chapter of Data Structures and Algorithms with Object-Oriented Design Patterns in C++ , by Bruno R. Preiss Priority Queues and Heapsort Introduction to heaps using tournaments, by Steven S. Skiena Priority Queues Introduction to priority queues, including k-heaps, Leftist heaps, and binomial queues, by Barry Kurtz Data Structures in C++ Case Study: Priority Queues Timothy Colburn's lecture slides on priority queues Priority Queues and Heaps Introduction to priority queues and heapsort, with C code

98. 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/

ANALYSIS of ALGORITHMS HOME PAGE Pages maintained by Philippe Flajolet , Rocquencourt, and 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

99. Stack Free Recursion A paper describing the Stack Free Recursion algorithm. C code with C++ comments. http://www.olympus.net/personal/7seas/recurse.html

C)opyright 1995, Otto J. A. Smith (206) 385-1956 otto@olympus.net Stack Free Recursion Otto J. A. Smith Sept 29, 1995 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

100. 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/

Department of Computer Science and Engineering, IIT Guwahati CS210: Data Structures Dr. R. K. Ghosh Home Notice Board Instructor TAs ... Submission Welcome to CS201 course webpage. Please note the URL of this site: http://www.cse.iitk.ac.in/users/dsrkg/cs201 Only this site will be updated. All other URLs that may be previously known to you may neither be valid nor be updated. Latest Happenings [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. Here is some java code to play with. Experiment with the programs to learn the Java programming language. See some interesting java applets to watch algorithms in action. For any clarifications, you may contact the TA s or the Instructor for the course.

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