搜索结果: 1-7 共查到“知识库 hypergraph”相关记录7条 . 查询时间(0.232 秒)
A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution
Hypergraph Partitioning Approach Coreference Resolution
2015/9/11
This work is focused on research in machine learning for coreference resolution. Coreference resolution is a natural language processing task that consists of determining the expressions in a discours...
The size of a hypergraph and its matching number
hypergraph its matching number Combinatorics
2011/9/22
Abstract: More than forty years ago, Erd\H{o}s conjectured that for any T <= N/K, every K-uniform hypergraph on N vertices without T disjoint edges has at most max{\binom{KT-1}{K}, \binom{N}{K} - \bin...
The condensation transition in random hypergraph 2-coloring
random structures phase transitions hypergraph 2-coloring second moment method
2011/9/5
Abstract: For many random constraint satisfaction problems such as random satisfiability or random graph or hypergraph coloring, the best current estimates of the threshold for the existence of soluti...
About maximal number of edges in hypergraph-clique with chromatic number 3
hypergraph-clique chromatic number 3 Combinatorics
2011/8/31
Abstract: Let $ H = (V,E) $ be a hypergraph. By the chromatic number of a hypergraph $ H = (V,E) $ we mean the minimum number $\chi(H)$ of colors needed to paint all the vertices in $ V $ so that any ...
We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they...
Computing the partition function for perfect matchings in a hypergraph
hypergraph perfect matching partition function permanent
2010/12/6
Given non-negative weights wS on the k-subsets S of a km-element set V , we consider the sum of the products wS1 · · ·wSm over all partitions V =S1 [ . . . [ Sm into pairwise disjoint k-subsets Si.
A Hypergraph Dictatorship Test with Perfect Completeness
Property testing Gowers norm Fourier analysis PCP
2012/12/3
A hypergraph dictatorship test is first introduced by Samorodnitsky and Trevisan and serves as a key component in their unique games based PCP construction.