Sciweavers

1066 search results - page 62 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
15 years 3 months ago
An efficient static algorithm for computing the soft error rates of combinational circuits
Soft errors have emerged as an important reliability challenge for nanoscale VLSI designs. In this paper, we present a fast and efficient soft error rate (SER) computation algorit...
Rajeev R. Rao, Kaviraj Chopra, David Blaauw, Denni...
FMSD
2006
104views more  FMSD 2006»
14 years 9 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
ISIPTA
2003
IEEE
140views Mathematics» more  ISIPTA 2003»
15 years 3 months ago
A Second-Order Uncertainty Model of Independent Random Variables: An Example of the Stress-Strength Reliability
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...
Lev V. Utkin
66
Voted
ICC
2007
IEEE
15 years 4 months ago
Optimizing Linear Dispersion Codes for Wideband MIMO Systems
Abstract— We consider the problem of designing space-timefrequency linear dispersion (LD) codes in wideband multipleinput multiple-output (MIMO) antenna systems employing orthogo...
Luca Venturino, Narayan Prasad, Xiaodong Wang, Moh...
TOG
2002
116views more  TOG 2002»
14 years 9 months ago
Linear combination of transformations
Geometric transformations are most commonly represented as square matrices in computer graphics. Following simple geometric arguments we derive a natural and geometrically meaning...
Marc Alexa