Sciweavers

39 search results - page 2 / 8
» Path-Based Supports for Hypergraphs
Sort
View
ACL
2006
13 years 5 months ago
Bootstrapping Path-Based Pronoun Resolution
We present an approach to pronoun resolution based on syntactic paths. Through a simple bootstrapping procedure, we learn the likelihood of coreference between a pronoun and a can...
Shane Bergsma, Dekang Lin
WWW
2008
ACM
13 years 3 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
13 years 3 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...
EJC
2006
13 years 3 months ago
Perfect matchings in uniform hypergraphs with large minimum degree
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...
Vojtech Rödl, Andrzej Rucinski, Endre Szemer&...
FOCI
2007
IEEE
13 years 10 months ago
Random Hypergraph Models of Learning and Memory in Biomolecular Networks: Shorter-Term Adaptability vs. Longer-Term Persistency
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
Byoung-Tak Zhang