十部經(jīng)典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE CHAPTER 1: INTRODUCTION CHAPTER 2: ARRAYS CHAPTER 3: STACKS AND QUEUES CHAPTER 4: LINKED LISTS CHAPTER 5: trees CHAPTER 6: GRAPHS CHAPTER 7: INTERNAL SORTING CHAPTER 8: EXTERNAL SORTING CHAPTER 9: SYMBOL TABLES CHAPTER 10: FILES APPENDIX A: SPARKS APPENDIX B: ETHICAL CODE IN INFORMATION PROCESSING APPENDIX C: ALGORITHM INDEX BY CHAPTER
標(biāo)簽： Fundamentals Structures Horowitz PREFACE
上傳時(shí)間： 2015-05-19
上傳用戶：維子哥哥
fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memory, so that larger trees and/or more bootstrap replicates become tractable. Much of fastDNAml is merely a recoding of the PHYLIP 3.3 DNAML program from PASCAL to C.
標(biāo)簽： fastDNAml attempt problem faster
上傳時(shí)間： 2014-01-24
上傳用戶：bjgaofei
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
標(biāo)簽： project implement developed Database
上傳時(shí)間： 2013-12-25
上傳用戶：semi1981
Perl & XML. by Erik T. Ray and Jason McIntosh ISBN 0-596-00205-X First Edition, published April 2002. (See the catalog page for this book.) Table of Contents Copyright Page Preface Chapter 1: Perl and XML Chapter 2: An XML Recap Chapter 3: XML Basics: Reading and Writing Chapter 4: Event Streams Chapter 5: SAX Chapter 6: Tree Processing Chapter 7: DOM Chapter 8: Beyond trees: XPath, XSLT, and More Chapter 9: RSS, SOAP, and Other XML Applications Chapter 10: Coding Strategies Index Colophon --------------------------------------------------------------------------------
標(biāo)簽： T. published McIntosh Edition
上傳時(shí)間： 2013-12-24
上傳用戶：yzhl1988
Source Insight Source Insight是一個(gè)革新的面向項(xiàng)目開發(fā)的程序編輯器和代碼瀏覽器，它擁有內(nèi)置的對(duì)C/C++, C#和Java等程序的分析。Source Insight能分析你的源代碼并在你工作的同時(shí)動(dòng)態(tài)維護(hù)它自己的符號(hào)數(shù)據(jù)庫，并自動(dòng)為你顯示有用的上下文信息。Source Insight不僅僅是一個(gè)強(qiáng)大的程序編輯器，它還能顯示reference trees，class inheritance diagrams和call trees。Source Insight提供了最快速的對(duì)源代碼的導(dǎo)航和任何程序編輯器的源信息。就將Source Insight應(yīng)用到你的項(xiàng)目開發(fā)過程中并切實(shí)感受它為你項(xiàng)目開發(fā)的效率帶來的變化。
標(biāo)簽： Insight Source 項(xiàng)目 程序
上傳時(shí)間： 2015-11-18
上傳用戶：wlcaption
DAGON Approach Object of this exercise: Given a subject graph and a set of pattern graph in canonical representation (2-input NAND and INV), implement the second step of DAGON approach. (Both the subject graph and the pattern graphs are trees.)
標(biāo)簽： graph Approach exercise subject
上傳時(shí)間： 2014-01-19
上傳用戶：stampede
Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the examples that are misclassified by each classifier. icsiboost implements Adaboost over stumps (one-level decision trees) on discrete and continuous attributes (words and real values). See http://en.wikipedia.org/wiki/AdaBoost and the papers by Y. Freund and R. Schapire for more details [1]. This approach is one of most efficient and simple to combine continuous and nominal values. Our implementation is aimed at allowing training from millions of examples by hundreds of features in a reasonable time/memory.
標(biāo)簽： meta-learning classifiers combining Boosting
上傳時(shí)間： 2016-01-30
上傳用戶：songnanhua
輕易學(xué)好C++編程技巧 - 進(jìn)楷 (香港科技大學(xué)筆記 19課) 內(nèi)容包括 1) base C++ review, 2) Pointers and Dynamic Objects, 3) Recursion,Linked Lists, 4) Stacks and Queues, 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary trees and Binary Search trees 11) AVL trees, 12) B+ trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing 18) Pattern Matching 19) Additional Review
標(biāo)簽： Pointers Dynamic Objects review
上傳時(shí)間： 2014-10-10
上傳用戶：chfanjiang
fast lua plugin indexing module, can cache lua bytecode functions for c programs. useful for building plugin index trees
標(biāo)簽： lua functions for bytecode
上傳時(shí)間： 2014-01-06
上傳用戶：wfeel
游戲開發(fā)數(shù)據(jù)結(jié)構(gòu)Data Structures for Game Programmers The Goodies Directory contains all sorts of stuff. For example, there are the four 3rd-Party libraries used in the book, SDL, SDL_TTF, FreeType (which SDL_TTF uses), and STLPort, which is one implementation of the Standard Template Library. Also, there are four articles on trees and SDL in the articles directory. These supplement the material in the book.
標(biāo)簽： Programmers Structures Directory contains
上傳時(shí)間： 2017-02-12
上傳用戶：qoovoop
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
