Sciweavers

23590 search results - page 121 / 4718
» Algorithm Performance Contest
Sort
View
EUROPAR
2005
Springer
14 years 2 months ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
WEBI
2005
Springer
14 years 2 months ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal
CDC
2009
IEEE
108views Control Systems» more  CDC 2009»
14 years 1 months ago
Robust stability and performance analysis for multiple model adaptive controllers
— For an Estimation Based Multiple Model Switched Adaptive Control (EMMSAC) algorithm controlling a MIMO minimal LTI plant, lp, 1 ≤ p ≤ ∞ bounds on the gain from the input ...
Dominic Pasqual Buchstaller, Mark French
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
14 years 26 days ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher
CORR
2010
Springer
169views Education» more  CORR 2010»
13 years 9 months ago
Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements
This paper examines the ability of greedy algorithms to estimate a block sparse parameter vector from noisy measurements. In particular, block sparse versions of the orthogonal mat...
Zvika Ben-Haim, Yonina C. Eldar