Sciweavers

2080 search results - page 15 / 416
» Measuring empirical computational complexity
Sort
View
LCPC
2004
Springer
14 years 3 months ago
Empirical Performance-Model Driven Data Layout Optimization
Abstract. Empirical optimizers like ATLAS have been very effective in optimizing computational kernels in libraries. The best choice of parameters such as tile size and degree of l...
Qingda Lu, Xiaoyang Gao, Sriram Krishnamoorthy, Ge...
MA
2010
Springer
140views Communications» more  MA 2010»
13 years 8 months ago
The Dirichlet Markov Ensemble
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
Djalil Chafaï
NDSS
2008
IEEE
14 years 4 months ago
Measuring and Detecting Fast-Flux Service Networks
We present the first empirical study of fast-flux service networks (FFSNs), a newly emerging and still not widelyknown phenomenon in the Internet. FFSNs employ DNS to establish ...
Thorsten Holz, Christian Gorecki, Konrad Rieck, Fe...
JWSR
2008
162views more  JWSR 2008»
13 years 8 months ago
Business Process Control-Flow Complexity: Metric, Evaluation, and Validation
Organizations are increasingly faced with the challenge of managing business processes, workflows, and recently, Web processes. One important aspect of business processes that has...
Jorge Cardoso
GPCE
2011
Springer
12 years 9 months ago
Comparing complexity of API designs: an exploratory experiment on DSL-based framework integration
Embedded, textual DSLs are often provided as an API wrapped around object-oriented application frameworks to ease framework integration. While literature presents claims that DSL-...
Stefan Sobernig, Patrick Gaubatz, Mark Strembeck, ...