688 search results - page 49 / 138 » General Partitioning on Random Graphs |
84
Voted
AUSDM
2006
Springer
15 years 4 months ago
2006
Springer
If the dataset available to machine learning results from cluster sampling (e.g. patients from a sample of hospital wards), the usual cross-validation error rate estimate can lead...
ECAL
2003
Springer
15 years 5 months ago
2003
Springer
We present a general method for evaluating and visualizing evolutionary dynamics of self-replicators using a graph-based representation for genealogy. Through a transformation from...
242
Voted
COMPGEOM
2011
ACM
14 years 4 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...
136
click to vote
CPC
2011
14 years 7 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
102
click to vote
COMPGEOM
2010
ACM
15 years 5 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...