Sciweavers

141 search results - page 6 / 29
» Bounding basis reduction properties
Sort
View
TVLSI
2010
13 years 4 months ago
Exploration of Heterogeneous FPGAs for Mapping Linear Projection Designs
In many applications, a reduction of the amount of the original data or a representation of the original data by a small set of variables is often required. Among many techniques, ...
Christos-Savvas Bouganis, Iosifina Pournara, Peter...
SAC
2010
ACM
14 years 4 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
AUTOMATICA
2006
97views more  AUTOMATICA 2006»
13 years 9 months ago
A model reference approach to safe controller changes in iterative identification and control
A controller change from a current controller which stabilises the plant to a new controller, designed on the basis of an approximate model of the plant and with guaranteed bounds...
A. Lecchini, Alexander Lanzon, Brian D. O. Anderso...
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
14 years 10 months ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
LATA
2009
Springer
14 years 4 months ago
Bounded Hairpin Completion
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
Masami Ito, Peter Leupold, Victor Mitrana