2450 search results - page 1 / 490 » Time Mapping with Hypergraphs |
ACL
1998
13 years 6 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
IPL
2006
13 years 5 months ago
2006
We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...
SIAMDM
2008
13 years 5 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
FCT
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
DAC
1997
ACM
13 years 9 months ago
1997
ACM
In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergra...