Sciweavers

3281 search results - page 551 / 657
» Bases for parametrized iterativity
Sort
View
CONCUR
2001
Springer
15 years 11 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
DAGM
2001
Springer
15 years 11 months ago
Optimal Camera Parameter Selection for State Estimation with Applications in Object Recognition
In this paper we introduce a formalism for optimal camera parameter selection for iterative state estimation. We consider a framework based on Shannon’s information theory and se...
Joachim Denzler, Christopher M. Brown, Heinrich Ni...
ER
2001
Springer
130views Database» more  ER 2001»
15 years 11 months ago
NF-SS: A Normal Form for Semistructured Schema
Semistructured data is becoming increasingly important for web applications with the development of XML and related technologies. Designing a “good” semistructured database is ...
Xiaoying Wu, Tok Wang Ling, Sin Yeung Lee, Mong-Li...
CSMR
2000
IEEE
15 years 11 months ago
A Proposal for Supporting Software Evolution in Componentware
In practice, a pure top-down and refinement-based development process is not applicable. A more iterative and incremental approach is usually applied with respect to changing req...
Andreas Rausch
DATE
2000
IEEE
114views Hardware» more  DATE 2000»
15 years 11 months ago
Automating RT-Level Operand Isolation to Minimize Power Consumption in Datapaths
Designs which do not fully utilize their arithmetic datapath components typically exhibit a significant overhead in power consumption. Whenever a module performs an operation who...
Michael Münch, Norbert Wehn, Bernd Wurth, Ren...