779 search results - page 78 / 156 » Algorithms for the Sample Mean of Graphs |
137
click to vote
TSP
2010
14 years 11 months ago
2010
In this correspondence, we propose an iterative "turbo" channel estimation algorithm for known symbol padding (KSP) orthogonal frequency-division multiplexing (OFDM), whe...
132
click to vote
CVPR
2000
IEEE
15 years 9 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
155
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
136
click to vote
SLS
2009
Springer
15 years 11 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
148
click to vote
FUIN
2008
15 years 4 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...