3281 search results - page 336 / 657 » Bases for parametrized iterativity |
175
click to vote
EMMCVPR
2007
Springer
16 years 29 days ago
2007
Springer
Skeleton can be viewed as a compact shape representation in that the shape can be completely reconstructed form the skeleton. We present a novel method for skeleton pruning that is...
159
click to vote
ICANN
2007
Springer
16 years 28 days ago
2007
Springer
We propose a fully distributed message passing algorithm based on expectation propagation for the purpose of sensor localization. Sensors perform noisy measurements of their mutual...
152
Voted
ISSAC
2007
Springer
16 years 28 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
169
click to vote
SCALESPACE
2007
Springer
16 years 27 days ago
2007
Springer
This paper proposes an extension of compressed sensing that allows to express the sparsity prior in a dictionary of bases. This enables the use of the random sampling strategy of c...
172
click to vote
FCCM
2006
IEEE
16 years 25 days ago
2006
IEEE
We present an architecture and an implementation of an FPGA-based sparse matrix-vector multiplier (SMVM) for use in the iterative solution of large, sparse systems of equations ar...