Sciweavers

1552 search results - page 42 / 311
» On the Complexity of Constant Propagation
Sort
View
JCP
2007
150views more  JCP 2007»
15 years 1 months ago
Bayesian Networks and Evidence Theory to Model Complex Systems Reliability
Abstract— This paper deals with the use of Bayesian Networks to compute system reliability of complex systems under epistemic uncertainty. In the context of incompleteness of rel...
Christophe Simon, Philippe Weber, Eric Levrat
CIVR
2006
Springer
172views Image Analysis» more  CIVR 2006»
15 years 5 months ago
Retrieving Shapes Efficiently by a Qualitative Shape Descriptor: The Scope Histogram
Abstract. Efficient image retrieval from large image databases is a challenging problem. In this paper we present a method offering constant time complexity for the comparison of t...
Arne Schuldt, Björn Gottfried, Otthein Herzog
ECRTS
2006
IEEE
15 years 8 months ago
The Dependency Management Framework: A Case Study of the ION CubeSat
Due to the complexity and requirements of modern realtime systems, multiple teams must often work concurrently and independently to develop the various components of the system. S...
Hui Ding, Leon Arber, Lui Sha, Marco Caccamo
DAM
2007
77views more  DAM 2007»
15 years 1 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
FOCS
1990
IEEE
15 years 6 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet