Location:
Search - DAGS
Search list
Description: 很好用的svm工具箱，dagsvm对于图像分类效果非常好，分类精度很高，代码清洗简单。-Good use of SVM Toolbox, dagsvm for image classification effect is very good, very high classification accuracy, code cleaning easy.
Platform: |
Size: 5120 |
Author: tang |
Hits:
Description: 这本书就是著名的沃塞曼编写的《统计学完全教程》，它的特点是覆盖全面、实用性强，除常规内容还包括Bootstrap方法、有向图DAGs估计、Wald检验、Delta方法、统计泛函估计等。-This book is prepared by well-known Wasserman 《ALL OF Statistics》, which are covered by the characteristics of a comprehensive, practical, in addition to conventional Bootstrap method also includes, DAGs have to plan estimates, Wald test, Delta method, statistical Functional estimation.
Platform: |
Size: 2621440 |
Author: 吴 |
Hits:
Description: Sybase PowerDesigner Physical Data Model
Getting Started
Platform: |
Size: 819200 |
Author: Luis |
Hits:
Description: 经典算法书(中文版)。这一套算法系列书介绍了当今最重要的算法，共分3卷，这是第2卷（第五部分），集中讲解图算法。本书共有6章（第17章～第22章）。第17章详细讨论图性质和类型，第18章~第22章分别讲解图搜索、有向图和DAG、最小生成树、最短路径以及网络流。书中提供了用C语言描述的完整算法源程序，并且配有丰富的插图和练习。-Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick s thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book s expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.
Coverage includes:
* A complete overview of graph properties and types
* Diagraphs and DAGs
* Minimum spanning trees
* Shortest paths
* Network flows
* Diagrams, sample C code, and detailed algorithm descriptions
Platform: |
Size: 13904896 |
Author: wang |
Hits:
Description: Thesis : Scheduling DAGs For Minimum Finish Time and Power Consumption on Heterogeneous Processors
Platform: |
Size: 210944 |
Author: Hamid |
Hits:
Description: 路由算法是影响网络性能的重要因素之一，对路由算法的选择至关重要。介绍路由算法中的Floyd算法和RAD（Routing along DAGs）算法，并通过实验对两种算法性能作出分析和比较。实验分析结果显示：在链路利用率、链路流量负载均衡和链路失效对网络的影响范围方面，RAD算法要优于Floyd算法。在平均传输代价方面，Floyd算法要优干RAD算法。(Routing algorithm is one of the most important factors affecting network performance, and it is very important to select routing algorithm. The Floyd algorithm and RAD (Routing along DAGs) algorithm in routing algorithm are introduced, and the performance of these two algorithms is analyzed and compared through experiments. The experimental results show that the RAD algorithm is better than Floyd algorithm in terms of link utilization, link traffic load balancing and link failure. In terms of average transmission cost, Floyd algorithm needs to do well in RAD algorithm.)
Platform: |
Size: 1024 |
Author: 小风Ho
|
Hits: