Sciweavers

6365 search results - page 922 / 1273
» Fast Local Computation Algorithms
Sort
View
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
15 years 4 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
ICASSP
2009
IEEE
15 years 4 months ago
Robust Bayesian tracking on Riemannian manifolds via fragments-based representation
Recently, the covariance region descriptor [1] has been proved robust and versatile for a modest computational cost. It enables efficient fusion of different types of features. Ba...
Yi Wu, Jinqiao Wang, Hanqing Lu
GRID
2010
Springer
15 years 4 months ago
Dynamic Partitioning of GATE Monte-Carlo Simulations on EGEE
Abstract The EGEE grid offers the necessary infrastructure and resources for reducing the running time of particle tracking Monte-Carlo applications like GATE. However, efforts are...
Sorina Camarasu-Pop, Tristan Glatard, Jakub T. Mos...
CORR
2011
Springer
158views Education» more  CORR 2011»
15 years 1 months ago
The power and Arnoldi methods in an algebra of circulants
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
David F. Gleich, Chen Greif, James M. Varah
EUROPAR
2011
Springer
14 years 6 months ago
A Fully Empirical Autotuned Dense QR Factorization for Multicore Architectures
: Tuning numerical libraries has become more difficult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...
Emmanuel Agullo, Jack Dongarra, Rajib Nath, Stanim...