Sciweavers

2310 search results - page 232 / 462
» Coloring Random Graphs
Sort
View
COMPGEOM
2011
ACM
12 years 12 months ago
Minors in random and expanding hypergraphs
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...
Uli Wagner
COMPGEOM
2010
ACM
14 years 1 months ago
On degrees in random triangulations of point sets
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...
Micha Sharir, Adam Sheffer, Emo Welzl
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 8 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
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...
Lars Backstrom, Jure Leskovec
IJSI
2008
91views more  IJSI 2008»
13 years 8 months ago
Random Event Structures
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...
Manfred Droste, Guo-Qiang Zhang
ISBI
2009
IEEE
14 years 3 months ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin