Sciweavers

5580 search results - page 795 / 1116
» Randomized priority algorithms
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
CUR from a Sparse Optimization Viewpoint
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
Jacob Bien, Ya Xu, Michael W. Mahoney
CVPR
2011
IEEE
15 years 2 months ago
Truncated Message Passing
Training of conditional random fields often takes the form of a double-loop procedure with message-passing inference in the inner loop. This can be very expensive, as the need to...
Justin Domke
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
15 years 1 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés
COMCOM
2011
15 years 1 months ago
Modeling gossip-based content dissemination and search in distributed networking
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and...
Siyu Tang, Eva Jaho, Ioannis Stavrakakis, Ioannis ...
CORR
2011
Springer
153views Education» more  CORR 2011»
15 years 1 months ago
Partially Linear Bayesian Estimation with Application to Sparse Approximations
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
Tomer Michaeli, Daniel Sigalov, Yonina C. Eldar