2944 search results - page 283 / 589 » Improving Bound Propagation |
154
click to vote
JMLR
2010
15 years 1 months ago
2010
We introduce a new method -- the group Dantzig selector -- for high dimensional sparse regression with group structure, which has a convincing theory about why utilizing the group...
137
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this work, we propose adaptive frequency-domain biased estimation algorithms with mechanisms to automatically adjust the shrinkage factors. The proposed estimation algorithms i...
154
click to vote
IROS
2006
IEEE
16 years 21 days ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
157
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
162
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...