87 search results - page 17 / 18 » Optimizing Sparse Data Structures for Matrix-vector Multiply |
DEXA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
106
click to vote
ICCV
1999
IEEE
15 years 3 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
101
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
108
click to vote
CVIU
2008
14 years 11 months ago
2008
A key problem in video content analysis using dynamic graphical models is to learn a suitable model structure given some observed visual data. We propose a Completed Likelihood AI...
96
Voted
TMC
2008
14 years 11 months ago
2008
We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...