Graph matching

Part 1 of ebook "Statistics and analysis of shapes" provides readers with contents including: medial axis computation and evolution; shape variation of medial axis representations via principal geodesic analysis on symmetric spaces; 2D shape modeling using skeletal graphs in a morse theoretic framework; matching with shape contexts;...

175p mothoiphong 28-06-2024 2 1   Download

Ebook Algorithms in C: Part 1 includes contents: Chapter 1: introduction, chapter 2: c, chapter 3: elementary data structures, chapter 4: trees, chapter 5: recursion, chapter 6: analysis of algorithms, chapter 7: implementation of algorithms, chapter 8: elementary sorting methods, chapter 9: quicksort, chapter 10: radix sorting, chapter 11: priority queues, chapter 12: mergesort, chapter 13: external sorting, chapter 14: elementary searching methods, chapter 15: balanced trees, chapter 16: hashing, chapter 17: radix searching, chapter 18: external searching, chapter 19: string searching, ch...

359p haojiubujain08 01-11-2023 2 1   Download

Ebook Algorithms in C: Part 2 includes contents: Chapter 24: elementary geometric methods, chapter 25: finding the convex hull, chapter 26: range searching, chapter 27: geometric intersection, chapter 28: closest-point problems, chapter 29: elementary graph algorithms, chapter 30: connectivity, chapter 31: weighted graphs, chapter 32: directed graphs, chapter 33: network flow, chapter 34: matching, chapter 35: random numbers, chapter 36: arithmetic, chapter 37: gaussian elimination, chapter 38: curve fitting, chapter 39: integration, chapter 40: parallel algorithms chapter 41: fast fourier ...

313p haojiubujain08 01-11-2023 3 1   Download

Accurate typing of human leukocyte antigen (HLA) is important because HLA genes play important roles in immune responses and disease genesis. Previously available computational methods are database-matching approaches and their outputs are inherently limited by the completeness of already known types, making them unsuitable for discovery of novel alleles.

16p vialfrednobel 29-01-2022 15 0   Download

Aligning protein-protein interaction (PPI) networks is very important to discover the functionally conserved sub-structures between different species. In recent years, the global PPI network alignment problem has been extensively studied aiming at finding the one-to-one alignment with the maximum matching score. However, finding large conserved components remains challenging due to its NP-hardness

18p vitzuyu2711 29-09-2021 13 1   Download

The alignment of protein-protein interaction networks was recently formulated as an integer quadratic programming problem, along with a linearization that can be solved by integer linear programming software tools.

14p vikentucky2711 24-11-2020 14 1   Download

We participated in the BioNLP 2013 shared tasks on event extraction. Our extraction method is based on the search for an approximate subgraph isomorphism between key context dependencies of events and graphs of input sentences.

15p vioklahoma2711 19-11-2020 5 1   Download

Brain disorders are one of the top causes of human death. Generally, neurologists analyze brain medical images for diagnosis. In the image analysis field, corners are one of the most important features, which makes corner detection and matching studies essential.

13p viconnecticut2711 29-10-2020 15 1   Download

This chapter extends your knowledge of query formulation to advanced matching problems. To solve these advanced matching problems, additional parts of the SELECT statement are introduced. This chapter continues with the learning approaches of Chapter 4: provide many examples to imitate and problem-solving guidelines to help you reason through difficult problems.

67p nanhankhuoctai9 23-06-2020 32 1   Download

Universities usually use academic credit systems for holding all training courses. They have to establish a suitable timetable for enrollment by students at beginning of every semester. This timetable must be met to all hard constraints and it is satisfied to soft constraints as high as possible. In some universities, students can enroll to the established timetable so that among of their courses is as much as possible. This leads to finish their studying program earlier than normally cases.

15p chauchaungayxua2 07-01-2020 21 1   Download

The MAM algorithm prefers to include the edge with the smallest assortativity weight (the assortative weight of the edges is updated for each iteration) until all the edges in the graph are covered.

29p vititan2711 13-08-2019 13 1   Download

Let G be a simple graph. We give an upper bound for reg I(G) in terms of the induced matching number of its spanning trees.

6p hvdungcdcn12 26-11-2018 33 2   Download

Chương này trình bày về Bài toán ghép cặp (Graph Matching) với những nội dung chính sau: Bài toán ghép cặp trên đồ thị, bài toán cặp ghép cực đại trên đồ thị hai phía, qui về bài toán luồng cực đại, đường tăng cặp ghép, thuật toán tìm cặp ghép cực đại,... Mời các bạn cùng tham khảo.

43p dien_vi01 04-10-2018 64 4   Download

Tài liệu Reinhard Diestel Graph Theory referred to the content you: The Basics, Matching, Covering and Packin, Connectivity, Planar Graphs, Extremal Graph Theory, Infinite Graphs, Ramsey Theory for Graphs, Hamilton Cycles,...

422p daicatho1989 12-03-2016 48 7   Download

We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment scores between a natural language question posed by the user and the candidate sentences returned from search engine. The textual entailment between two sentences is assessed via features representing high-level attributes of the entailment problem such as sentence structure matching, question-type named-entity matching based on a question-classifier, etc.

9p hongphan_1 14-04-2013 43 2   Download

We study random surfaces which arise as height functions of random perfect matchings (a.k.a. dimer configurations) on a weighted, bipartite, doubly periodic graph G embedded in the plane. We derive explicit formulas for the surface tension and local Gibbs measure probabilities of these models. The answers involve a certain plane algebraic curve, which is the spectral curve of the Kasteleyn operator of the graph. For example, the surface tension is the Legendre dual of the Ronkin function of the spectral curve. The amoeba of the spectral curve represents the phase diagram of the dimer model.

39p noel_noel 17-01-2013 51 7   Download

Data Structures and Algorithms: Table of Contents Data Structures and Algorithms Alfred V. Aho, Bell Laboratories, Murray Hill, New Jersey John E. Hopcroft, Cornell University, Ithaca, New York Jeffrey D.

620p rose_12 06-12-2012 84 15   Download

Tours and Matchings 3.1 Eulerian graphs Đầu tiên thích hợp vấn đề trong lý thuyết đồ thị là cây cầu Königsberg vấn đề. Nói chung, vấn đề này liên quan đến di chuyển xung quanh một đồ thị là một trong những cố gắng tránh sử dụng cùng một cạnh hai lần. Trong thực tế những vấn đề này Euler xảy ra, ví dụ, trong mạng lưới phân phối tối ưu hóa - chẳng hạn như phát thư, để tiết kiệm thời gian đường phố nên được đi du lịch chỉ một lần. Vấn đề tương tự xảy ra...

13p doquyenhong 27-10-2011 96 4   Download

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí Department of Mathematic dành cho các bạn yêu thích môn toán học đề tài: Rainbow matchings in properly edge colored graphs...

7p thulanh7 05-10-2011 52 1   Download

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí Department of Mathematic dành cho các bạn yêu thích môn toán học đề tài: Perfect Matchings in Claw-free Cubic Graphs...

6p thulanh7 05-10-2011 44 1   Download