Sciweavers

2374 search results - page 431 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 9 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
INFOCOM
2009
IEEE
14 years 2 months ago
Time Valid One-Time Signature for Time-Critical Multicast Data Authentication
Abstract—It is challenging to provide authentication to timecritical multicast data, where low end-to-end delay is of crucial importance. Consequently, it requires not only effi...
Qiyan Wang, Himanshu Khurana, Ying Huang, Klara Na...
VRCAI
2006
ACM
14 years 1 months ago
Parallel-split shadow maps for large-scale virtual environments
Shadowing effects dramatically enhance the realism of virtual environments by providing useful visual cues. Shadow mapping is an efficient algorithm for real-time shadow renderin...
Fan Zhang, Hanqiu Sun, Leilei Xu, Lee Kit Lun
PPOPP
2010
ACM
14 years 5 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
ICDCSW
2005
IEEE
14 years 1 months ago
Probability Based Power Aware Error Resilient Coding
Error resilient encoding in video communication is becoming increasingly important due to data transmission over unreliable channels. In this paper, we propose a new power-aware e...
Minyoung Kim, Hyunok Oh, Nikil D. Dutt, Alexandru ...