8512 search results - page 213 / 1703 » Computing Theory With Relevance |
136
Voted
CIMAGING
2009
15 years 2 months ago
2009
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
155
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
286
Voted
AMC
2011
14 years 8 months ago
2011
The present paper studies the probability of ruin of an insurer, if excess of loss reinsurance with reinstatements is applied. In the setting of the classical CramerLundberg risk ...
111
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
123
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...