Sciweavers

16430 search results - page 360 / 3286
» On Computable Tree Functions
Sort
View
DSN
2004
IEEE
15 years 9 months ago
Safety Optimization: A Combination of Fault Tree Analysis and Optimization Techniques
Abstract-We present a new form of quantitative safety analysis safety optimization. This method is a combination of fault tree analysis(FTA) and mathematical optimization technique...
Frank Ortmeier, Wolfgang Reif
RT
1995
Springer
15 years 8 months ago
Rendering Trees from Precomputed Z-Buffer Views
Parallel projection z-buffer images are precomputed for a number of preset viewing directions on the unit sphere. Using the depth information, we can reconstruct a 3-D point from e...
Nelson L. Max, Keiichi Ohsaki
GLOBECOM
2008
IEEE
15 years 5 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
NCA
2006
IEEE
15 years 5 months ago
Open-loop regulation and tracking control based on a genealogical decision tree
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
Kaddour Najim, Enso Ikonen, P. Del Moral
141
Voted
TCS
2008
15 years 5 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven