Sciweavers

330 search results - page 13 / 66
» Effective Complexity and its Relation to Logical Depth
Sort
View
JCST
2010
189views more  JCST 2010»
13 years 2 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
AOSD
2011
ACM
13 years 2 months ago
Measuring the effects of aspect-oriented refactoring on component relationships: two case studies
Aspect-oriented refactoring is a promising technique for improving modularity and reducing complexity of existing software systems through encapsulating crosscutting concerns. As ...
Reishi Yokomori, Harvey P. Siy, Norihiro Yoshida, ...
BMCBI
2008
163views more  BMCBI 2008»
13 years 7 months ago
Nuclear staining and relative distance for quantifying epidermal differentiation in biomarker expression profiling
Background: The epidermal physiology results from a complex regulated homeostasis of keratinocyte proliferation, differentiation and death and is tightly regulated by a specific p...
Thora Pommerencke, Thorsten Steinberg, Hartmut Dic...
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
13 years 9 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
14 years 9 months ago
Propagating XML Constraints to Relations
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...