3694 search results - page 351 / 739 » Stochastic complexity in learning |
205
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
208
click to vote
TIT
2010
15 years 1 months ago
2010
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
187
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
183
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
190
Voted
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...