6 search results - page 1 / 2 » On properties of random dissections and triangulations |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
DCG
1999
13 years 4 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
UAI
2003
13 years 5 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
IM
2008
13 years 4 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
BMCBI
2007
13 years 4 months ago
2007
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...