1647 search results - page 187 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
136
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
145
click to vote
UAI
2008
15 years 6 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
243
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
152
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
167
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...