Sciweavers

860 search results - page 12 / 172
» Podcasting made simple
Sort
View
143
Voted
JMIV
2011
135views more  JMIV 2011»
14 years 7 months ago
Periodic Plus Smooth Image Decomposition
When the Discrete Fourier Transform of an image is computed, the image is implicitly assumed to be periodic. Since there is no reason for opposite borders to be alike, the “peri...
Lionel Moisan
TCS
2011
14 years 7 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ICASSP
2011
IEEE
14 years 4 months ago
Weighted compressed sensing and rank minimization
—We present an alternative analysis of weighted 1 minimization for sparse signals with a nonuniform sparsity model, and extend our results to nuclear norm minimization for matric...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
94
Voted
TSMC
2011
289views more  TSMC 2011»
14 years 7 months ago
Formalizing Functional Flow Block Diagrams Using Process Algebra and Metamodels
Abstract—Functional flow block diagrams (FFBDs) are a traditional tool of systems engineering and remain popular in some systems engineering domains. However, their lack of form...
Allan I. McInnes, Brandon K. Eames, Russell J. Gro...
110
Voted
DCG
2007
91views more  DCG 2007»
15 years 20 days ago
Which n-Venn Diagrams Can Be Drawn with Convex k-Gons?
We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of conve...
Jeremy Carroll, Frank Ruskey, Mark Weston