Sciweavers

3608 search results - page 140 / 722
» computer 2011
Sort
View
176
Voted
CHI
2011
ACM
14 years 7 months ago
Fragile online relationship: a first look at unfollow dynamics in twitter
We analyze the dynamics of the behavior known as ‘unfollow’ in Twitter. We collected daily snapshots of the on
Haewoon Kwak, Hyunwoo Chun, Sue B. Moon
136
Voted
TCS
2011
14 years 10 months ago
Bitonic sorters of minimal depth
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
Tamir Levi, Ami Litman
144
Voted
CGF
2011
14 years 10 months ago
A Survey of Real-Time Hard Shadow Mapping Methods
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard
Daniel Scherzer, Michael Wimmer, Werner Purgathofe...
146
Voted
SIAMMAX
2011
180views more  SIAMMAX 2011»
14 years 10 months ago
Computing Characteristic Polynomials from Eigenvalues
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...
Rizwana Rehman, Ilse C. F. Ipsen
151
Voted
TMC
2011
131views more  TMC 2011»
14 years 10 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—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...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan