Sciweavers

185 search results - page 8 / 37
» Constructions of Grassmannian Simplices
Sort
View
TIP
2002
154views more  TIP 2002»
15 years 5 months ago
Minimizing the total variation under a general convex constraint for image restoration
In this paper, we present a general framework for image restoration; despite its simplicity, certain variational and certain wavelet approaches can be formulated within this framew...
François Malgouyres
ICC
2009
IEEE
105views Communications» more  ICC 2009»
15 years 3 months ago
Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming
This paper proposes Reflected Simplex codebooks for limited feedback beamforming in multiple-input multipleoutput (MIMO) wireless systems. The codebooks are a geometric constructio...
Daniel J. Ryan, Iain B. Collings, Jean-Marc Valin
APSEC
2005
IEEE
15 years 11 months ago
Tool Support for Invariant Based Programming
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...
Ralph-Johan Back, Magnus Myreen
TABLEAUX
2009
Springer
15 years 10 months ago
Tableaux for Projection Computation and Knowledge Compilation
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
Christoph Wernhard
TIP
2008
89views more  TIP 2008»
15 years 6 months ago
Snakuscules
Abstract--A snakuscule (a minuscule snake) is the simplest active contour that we were able to design while keeping the quintessence of traditional snakes: an energy term governed ...
Philippe Thévenaz, Michael Unser