1263 search results - page 85 / 253 » A* with Bounded Costs |
153
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
172
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
206
click to vote
MP
2011
15 years 1 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
280
click to vote
SIAMIS
2011
15 years 1 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
164
click to vote
SIAMJO
2010
15 years 1 months ago
2010
In this work we introduce for extended real valued functions, defined on a Banach space X, the concept of K directionally Lipschitzian behavior, where K is a bounded subset of X. F...