Xem 1-20 trên 1194 kết quả Graphs
  • "Luận văn Thạc sĩ: Sử dụng phương pháp Graph trong dạy học Toán ở trường THPT nhằm tích cực hoá hoạt động học tập của học sinh" nhằm tìm hướng vận dụng phương pháp Graph để xây dựng một số Graph nội dung và Graph hoạt động vào dạy học Toán ở trường THPT theo chương trình mới.

    pdf114p tuyetmuadong2013 23-04-2013 195 72   Download

  • Tham khảo tài liệu 'cam created using graph feature', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

    pdf12p nguyenphuong_28 29-04-2010 95 29   Download

  • Việc nghiên cứu và áp dụng phương pháp Graph trong dạy học Văn học sử ở Trung học phổ thông là một hướng nhằm góp phần đổi mới phương pháp dạy học môn Ngữ Văn nói riêng và trong dạy học nói chung. Mời quý thầy cô tham khảo sáng kiến “Sử dụng Graph trong dạy học Văn học sử ở THPT”.

    pdf38p thivuhuong 18-05-2014 117 27   Download

  • Tài liệu tham khảo bằng tiếng Anh về hội họa - Graph Drawing - Trees

    pdf32p audi123 31-07-2010 60 18   Download

  • Điểm mới ở sáng kiến “Ứng dụng phương pháp graph vào dạy học Ngữ Văn 11” là ứng dụng thực tế vào bài giảng và đưa ra một số trường hợp có thể ứng dụng phương pháp graph để thấy rằng đây là phương pháp hay, hữu ích cho môn học. Mời quý thầy cô tham khảo sáng kiến trên.

    pdf18p huonglotos 17-04-2014 109 29   Download

  • Clear, lively style covers all basics of theory and application, including mathematical models, elementary concepts of graph theory, transportation problems, connection problems, party problems, diagraphs and mathematical models, games and puzzles, graphs and social psychology, planar graphs and coloring problems, and graphs and other mathematics.

    pdf323p lumia_12 27-05-2013 30 16   Download

  • Graph theory can be said to have its beginning in 1736 when EULER considered the (general case of the) Königsberg bridge problem: Is there a walking route that crosses each of the seven bridges of Königsberg exactly once? (Solutio Problematis ad geometriam situs pertinentis, Commentarii Academiae Scientiarum Imperialis Petropolitanae 8 (1736), pp. 128-140.) It took 200 years before the first book on graph theory was written. This was done by KÖNIG in 1936. (“Theorie der endlichen und unendlichen Graphen”, Teubner, Leipzig, 1936. Translation in English, 1990.

    pdf0p kuckucucu 15-05-2012 37 11   Download

  • Planarization method s if the graph is nonplanar, make it planar! (by placing dummy vertices at the crossings) s use one of the drawing algorithms for planar graphs e.g., GIOTTO [Tamassia Batini Di Battista 87] Orientation method s orient the graph into a digraph s use one the drawing algorithms for digraphs Force-Directed method s define a system of forces acting on the vertices and edges s find a minimum energy state (solve differential equations or simulate the evolution of the system)

    pdf15p audi123 31-07-2010 48 9   Download

  • The number of distinct embeddings is exponential in the worst case triconnected planar graphs have a unique embedding. The Complexity of Planarity

    pdf19p audi123 31-07-2010 47 9   Download

  • Shimon Even’s Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition,with a foreword byRichard M.Karp and notes byAndrewV.Goldberg, continues the exceptional presentation from the first edition and explains algorithms in formal but simple language with a direct and intuitive presentation. The material covered by the book begins with basic material, including graphs and shortest paths, trees, depth-first search, and breadth-first search.

    pdf204p hotmoingay3 09-01-2013 44 9   Download

  • It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at least 2pd − 1 cos(  2k ). A similar result has been proved by Friedman using more sophisticated tools.More generally, Serre has shown (see [3], [4] ) that for any fixed r and for any infinite family of d-regular graphs Gi, lim inf r(Gi) 2pd − 1. The same result has been proved by Friedman already in [5].

    pdf4p thulanh5 12-09-2011 58 5   Download

  • A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by Conforti, Cornu´jols and Vuˇkovi´ — that every Berge graph either falls into e s c one of a few basic classes, or...

    pdf180p noel_noel 17-01-2013 22 5   Download

  • 4.6.Làm việc với công cụ Graph Paper Công cụ Graph Paper Tool dùng để tạo ra hàng trăm hay thậm chí hàng ngàn hình chữ nhật được nhóm lại với nhau tương tự như một giấy vẽ kỹ thuật rất thích hợp cho vẽ biểu đồ

    pdf3p suadaunanh 03-08-2010 61 4   Download

  • Spelling correction for keyword-search queries is challenging in restricted domains such as personal email (or desktop) search, due to the scarcity of query logs, and due to the specialized nature of the domain. For that task, this paper presents an algorithm that is based on statistics from the corpus data (rather than the query log). This algorithm, which employs a simple graph-based approach, can incorporate different types of data sources with different levels of reliability (e.g., email subject vs.

    pdf10p hongdo_1 12-04-2013 19 4   Download

  • This book aims to explain the basics of graph theory that are needed at an introductory level for students in computer or information sciences. To motivate students and to show that even these basic notions can be extremely useful, the book also aims to provide an introduction to the modern field of network science. Mathematics is often unnecessarily difficult for students, at times even intimidating.

    pdf299p ringphone 06-05-2013 22 4   Download

  • .Trước khi Facebook tung ra Graph Search cho toàn bộ người dùng tại Việt Nam, hãy tìm hiểu bạn có thể làm những gì với công cụ tìm kiếm này của Facebook. Graph Search là một công cụ tìm kiếm mới của Facebook cho phép tìm kiếm về con người, tranh ảnh, địa danh và mối quan tâm của những người liên quan tới bạn trên Facebook. Tìm hiểu thêm về Graph Search tại đây. Facebook bắt đầu tung ra công cụ tìm kiếm Graph Search bản beta cho người dùng tại Mỹ.

    pdf9p qiqinn 25-07-2013 21 4   Download

  • We present a mobile touchable application for online topic graph extraction and exploration of web content. The system has been implemented for operation on an iPad. The topic graph is constructed from N web snippets which are determined by a standard search engine. We consider the extraction of a topic graph as a specific empirical collocation extraction task where collocations are extracted between chunks.

    pdf6p hongdo_1 12-04-2013 25 3   Download

  • This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarization), biased LexRank (for passage retrieval), and TUMBL (for binary classification). All tools in the collection are based on random walks on lexical graphs, that is graphs where different NLP objects (e.g., sentences or phrases) are represented as nodes linked by edges proportional to the lexical similarity between the two nodes.

    pdf4p hongvang_1 16-04-2013 21 3   Download

  • This paper describes methods for relating (threading) multiple newspaper articles, and for visualizing various characteristics of them by using a directed graph. A set of articles is represented by a set of word vectors, and the similarity between the vectors is then calculated. The graph is constructed from the similarity matrix. By applying some constraints on the chronological ordering of articles, an efficient threading algorithm that runs in O(n) time (where n is the number of articles) is obtained. ...

    pdf7p bunrieu_1 18-04-2013 27 3   Download

  • Transition-based dependency parsers are often forced to make attachment decisions at a point when only partial information about the relevant graph configuration is available. In this paper, we describe a model that takes into account complete structures as they become available to rescore the elements of a beam, combining the advantages of transition-based and graph-based approaches. We also propose an efficient implementation that allows for the use of sophisticated features and show that the completion model leads to a substantial increase in accuracy.

    pdf11p bunthai_1 06-05-2013 12 3   Download


Đồng bộ tài khoản