4843 search results - page 472 / 969 » The Shortcut Problem - Complexity and Approximation |
174
Voted
ACL
2009
15 years 4 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...
168
Voted
AUSAI
2010
Springer
15 years 3 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...
151
Voted
FUIN
2010
15 years 3 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...
152
click to vote
CDC
2010
IEEE
15 years 1 months 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...
206
click to vote
MA
2011
Springer
15 years 1 months ago
2011
Springer
The ratio of the largest eigenvalue divided by the trace of a p×p random Wishart matrix with n degrees of freedom and identity covariance matrix plays an important role in variou...