750 search results - page 61 / 150 » Reconstruction for Models on Random Graphs |
116
Voted
ESA
2005
Springer
15 years 8 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
158
click to vote
KDD
2012
ACM
13 years 5 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
ISCAS
2006
IEEE
15 years 9 months ago
2006
IEEE
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
130
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
154
click to vote
ICASSP
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...