2354 search results - page 313 / 471 » Randomness, Stochasticity and Approximations |
170
click to vote
INFOCOM
2008
IEEE
16 years 17 days ago
2008
IEEE
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
119
click to vote
INFOCOM
2006
IEEE
16 years 6 days ago
2006
IEEE
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
178
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
154
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
151
click to vote
NIPS
2007
15 years 7 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...