51 search results - page 4 / 11 » On the density of a graph and its blowup |
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—This paper provides a new iterative solution to the problem of the joint estimation of phase noise and residual carrier frequency offset in an orthogonal frequency division mult...
ISMVL
2007
IEEE
14 years 1 months ago
2007
IEEE
Stochastic computation is a new alternative approach for iterative computation on factor graphs. In this approach, the information is represented by the statistics of the bit stre...
INCDM
2010
Springer
13 years 6 months ago
2010
Springer
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
ALGORITHMICA
2007
13 years 7 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...