Sciweavers

224 search results - page 39 / 45
» A Flexible Class of Parallel Matrix Multiplication Algorithm...
Sort
View
ACCV
2006
Springer
14 years 11 months ago
Learning Multi-category Classification in Bayesian Framework
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
Atul Kanaujia, Dimitris N. Metaxas
CLUSTER
2004
IEEE
15 years 1 months ago
Application-specific scheduling for the organic grid
We propose a biologically inspired and fully-decentralized approach to the organization of computation that is based on the autonomous scheduling of strongly mobile agents on a pe...
Arjav J. Chakravarti, Gerald Baumgartner, Mario La...
SOSP
2009
ACM
15 years 6 months ago
Distributed aggregation for data-parallel computing: interfaces and implementations
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
Yuan Yu, Pradeep Kumar Gunda, Michael Isard
PPAM
2005
Springer
15 years 3 months ago
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
Pavel Tvrdík, Ivan Simecek
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
15 years 3 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...