# 11019 hobbies in graph

## Báo cáo khoa học: "Experiments in Graph-based Semi-Supervised Learning Methods for Class-Instance Acquisition" docx

... Workshop on Machine Learning for Web Search A Carlson, J Betteridge, R.C Wang, E.R Hruschka Jr, and T.M Mitchell 2010 Coupled Semi-Supervised Learning for Information Extraction In Proceedings of the ... reproducible research in this area Topics for future work include the incorporation of other kinds of semantic constraint for improved class-instance acquisition, further investigation into per-node ... that class-instance acquisition performance can be signiﬁcantly improved by incorporating additional semantic constraints in the class-instance acquisition process, which for the experiments in...
• 9
• 148
• 1

## Báo cáo toán học: "Two Extremal Problems in Graph Theory" pot

... then their union is the graph G ∪ H consisting of disjoint copies of G and H If m is a positive integer, then mG is the graph consisting of m disjoint copies of G We call a graph bisectable provided ... this is settled in the next theorem By considering complements, we obtain the following equivalent formulation of Problem in this case: Determine the minimum number of edges of a graph of order ... = K1 ∪ 3K3 Since G∗ cannot be obtained by applying a transformation in Lemma 8, G = K1 ∪ 3K3 Now suppose that G† was obtained from a graph G∗ by applying the transformation (ii) in Lemma Then...
• 10
• 299
• 0

## Báo cáo toán học: "Distinct Distances in Graph Drawings" ppt

... three points are collinear in a (non-degenerate) drawing of Kn Thus dn(Kn ) equals the minimum number of distinct distances determined by n points in the plane with no three points collinear This ... G to distinct points in the plane, and maps each edge vw of G to the open straight-line segment joining the two points representing v and w A drawing of G is a degenerate drawing of G in which ... A (since A intersects a unit-circle centred at a vertex except p in at most two points) Since there are no elements of T − v in R, there are no crossings in the resulting drawing and the induction...
• 23
• 115
• 0

## Advances in Graph Drawing Special Issue on Selected Papers from the Sixth International Symposium on Graph Drawing, GD98 Guest Editors Foreword

... Whitesides, Guest Editors Foreword , JGAA, 4(3) 1–3 (2000)2 Introduction This Special Issue on the Sixth International Symposium on Graph Drawing (GD’98)1 brings together eight papers based on work ... visualization systems We have also included a contribution based on the GD’98 Graph Drawing Contest This contest is an annual conference tradition Long before the conference takes place, the contest ... presented at the conference As editors, we chose to invite papers from GD’98 that would reflect the broad nature of the annual symposia on graph drawing, which showcase theoretical contributions as...
• 3
• 106
• 0

## PARALLELIZATION OF ALGORITHMS IN GRAPH NETWORK

... choose (vmin, emin)  TE so that L(vmin, emin)=m, Set TE=TE-{(vmin, emin)}, SE=SE  {(vmin, emin)}, go to step Step If vmin  S , then set le(vmin)=emin, S=S  vmin  , l(vmin)=L(vmin , emin), T=T-{vmin} ... Firstly, Investigating and discovering parallel processing theory, investigating graphic theiory, mainly focus on parallel algorithms finding the shortest and finding the maximum flow in normal graph ... huge input data in our daily life Objects and Scope of the study  Objects of the study - Investigating and discovering parallel processing theory, parallel processing models - Investigating graphic...
• 26
• 167
• 0

...
• 1
• 1,977
• 10

## Báo cáo khoa học: "Bypassed Alignment Graph for Learning Coordination in Japanese Sentences" doc

... http://nlp.kuee.kyoto-u.ac.jp/nl-resource/ corpus/KyotoCorpus4.0 /doc/ syn guideline.pdf H Okuma, M Shimbo, K Hara, and Y Matsumoto 2009 Bypassed alignment graph for learning coordination in Japanese sentences: supplementary ... original alignment graph with a “bypass” devoted to explicitly indicate that no coordination exists in a sentence; i.e., we add a special path directly connecting the initial node and the terminal ... original SH in terms of F1 measure in coordination scope detection Adding bypasses to alignment graphs further improved the performance, making a total of +4.7 points in F1 over SH; recall signiﬁcantly...
• 4
• 143
• 0

## Báo cáo khoa học: "A Graph Approach to Spelling Correction in Domain-Centric Search" doc

... experimental study in Section Finally, we make concluding remarks and discuss future directions in Section Spelling- Correction Algorithm In this section, we describe our algorithm for spelling correction ... they can split into non-bigrams (without a huge index) and to handle simultaneous merging and splitting as in our running example (1) Furthermore, they translate bigram information into edge weights, ... For generating spelling errors, we implemented a typo generator.1 This generator extends an online typo generator (Seobook, 2010) that produces a variety of spelling errors, including skipped...
• 10
• 186
• 0

...
• 2
• 63
• 0

## Báo cáo hóa học: " Research Article Karhunen-Lo` ve-Based Reduced-Complexity Representation e of the Mixed-Density Messages in SPA on Factor Graph and Its Impact on BER" ppt

... parameterization (e. g., Gaussian message) These messages are presented in the AWGN channel model The rest of the messages are mixed continuous and discrete messages These mixture messages are continuously ... description) 4.2.2 Message Types Presented in the FG /SPA The FG cont-ains both discrete and continuous messages The discrete messages are presented in the coder There is no need for the investigation ... types presented in the literature We compare only the message representations The update rules are performed “ideally” by the numerical integration in the simulations The Fourier representation...
• 11
• 166
• 0

...
• 2
• 447
• 0

...
• 2
• 289
• 0

• 2
• 159
• 0

Xem thêm