507 search results - page 8 / 102 » Efficient Approximate Wordlength Optimization |
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
111
click to vote
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
MOC
2000
14 years 9 months ago
2000
We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...