2949 search results - page 135 / 590 » Universal Sparse Modeling |
116
click to vote
TIP
2010
14 years 11 months ago
2010
Abstract—This paper introduces a novel examplar-based inpainting algorithm through investigating the sparsity of natural image patches. Two novel concepts of sparsity at the patc...
116
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
Release99 of UMTS (Universal Mobile Telecommunication System) network supports conversational services by means of UTRAN (Universal Terrestrial Radio Access Network) Dedicated tran...
85
Voted
MLQ
2000
15 years 18 days ago
2000
It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic [2]. In the special case of quasivarieties a direct tran...
80
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
90
Voted
ISPDC
2005
IEEE
15 years 6 months ago
2005
IEEE
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...