1591 search results - page 126 / 319 » Random lifts of graphs |
346
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
161
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
227
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
181
click to vote
IJSI
2008
15 years 6 months ago
2008
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
222
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a ...