3608 search results - page 140 / 722 » compute 2011 |
191
click to vote
CHI
2011
ACM
14 years 8 months ago
2011
ACM
We analyze the dynamics of the behavior known as ‘unfollow’ in Twitter. We collected daily snapshots of the on
149
click to vote
TCS
2011
14 years 11 months ago
2011
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
159
click to vote
CGF
2011
14 years 11 months ago
2011
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard
155
click to vote
SIAMMAX
2011
14 years 11 months ago
2011
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
164
Voted
TMC
2011
14 years 11 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...