Sciweavers

2186 search results - page 149 / 438
» Considering an Organization's Memory
Sort
View
IM
2007
15 years 6 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
ETS
2010
IEEE
153views Hardware» more  ETS 2010»
15 years 5 months ago
Analysis of resistive-bridging defects in SRAM core-cells: A comparative study from 90nm down to 40nm technology nodes
ÑIn this paper, we present a comparative study on the effects of resistive-bridging defects in the SRAM core-cells, considering different technology nodes. In particular, we analy...
Renan Alves Fonseca, Luigi Dilillo, Alberto Bosio,...
MFCS
2010
Springer
15 years 5 months ago
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
Gero Greiner, Riko Jacob
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 9 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
PET
2012
Springer
13 years 9 months ago
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams
We consider applications scenarios where an untrusted aggregator wishes to continually monitor the heavy-hitters across a set of distributed streams. Since each stream can contain ...
T.-H. Hubert Chan, Mingfei Li, Elaine Shi, Wenchan...