Sciweavers

519 search results - page 2 / 104
» Using Goal-Models to Analyze Variability
Sort
View
TCSV
2002
88views more  TCSV 2002»
13 years 4 months ago
Variable complexity DCT approximations driven by an HVQ-based analyzer
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
Ricardo L. de Queiroz
JCST
2010
189views more  JCST 2010»
12 years 12 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
HASE
2007
IEEE
13 years 9 months ago
Goal-Oriented Patterns for UML-Based Modeling of Embedded Systems Requirements
Embedded systems are used for critical applications that must adhere to safety constraints. Developers of these systems face three key challenges when attempting to apply existing...
Heather Goldsby, Sascha Konrad, Betty H. C. Cheng
IDA
2005
Springer
13 years 10 months ago
A Knowledge-Based Model for Analyzing GSM Network Performance
Abstract. In this paper, a method to analyze GSM network performance on the basis of massive data records and application domain knowledge is presented. The available measurements ...
Pasi Lehtimäki, Kimmo Raivio
ESEM
2007
ACM
13 years 9 months ago
Using Context Distance Measurement to Analyze Results across Studies
Providing robust decision support for software engineering (SE) requires the collection of data across multiple contexts so that one can begin to elicit the context variables that...
Daniela Cruzes, Victor R. Basili, Forrest Shull, M...