2949 search results - page 68 / 590 » Universal Sparse Modeling |
125
click to vote
AAECC
2007
Springer
15 years 23 days ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
94
Voted
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
108
click to vote
RSA
2011
14 years 7 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
95
Voted
ALGORITHMICA
2010
15 years 23 days ago
2010
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
108
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
We treat the security of group key exchange (GKE) in the universal composability (UC) framework. Analyzing GKE protocols in the UC framework naturally addresses attacks by maliciou...