Sciweavers

2080 search results - page 54 / 416
» Measuring empirical computational complexity
Sort
View
TIP
2010
161views more  TIP 2010»
13 years 4 months ago
Automatic Parameter Selection for Denoising Algorithms Using a No-Reference Measure of Image Content
Across the field of inverse problems in image and video processing, nearly all algorithms have various parameters which need to be set in order to yield good results. In practice, ...
Xiang Zhu, Peyman Milanfar
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 10 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 10 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
PERCOM
2010
ACM
14 years 1 months ago
Decomposing power measurements for mobile devices
—Modern mobile phones are an appealing platform for pervasive computing applications. However, the complexity of these devices makes it difficult for developers to understand th...
Andrew Colin Rice, Simon Hay
IJHPCA
2006
73views more  IJHPCA 2006»
13 years 10 months ago
The Tau Parallel Performance System
The ability of performance technology to keep pace with the growing complexity of parallel and distributed systems depends on robust performance frameworks that can at once provid...
Sameer Shende, Allen D. Malony