4894 search results - page 483 / 979 » The Guarding Problem - Complexity and Approximation |
163
click to vote
ICIP
2010
IEEE
2010
IEEE
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
15 years 3 months ago
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
152
Voted
ACL
2009
15 years 2 months ago
2009
Stochastic gradient descent (SGD) uses approximate gradients estimated from subsets of the training data and updates the parameters in an online fashion. This learning framework i...
153
click to vote
AUSAI
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
140
click to vote
FUIN
2010
15 years 2 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
137
Voted
CDC
2010
IEEE
15 years 3 days ago
2010
IEEE
We present an on-line crosslayer control technique to characterize and approximate optimal policies for wireless networks. Our approach combines network utility maximization and ad...