2354 search results - page 254 / 471 » Randomness, Stochasticity and Approximations |
147
click to vote
JMIV
2002
15 years 5 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
160
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
343
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
161
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
142
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...