Sciweavers

4934 search results - page 246 / 987
» complexity 2008
Sort
View
TCOM
2010
122views more  TCOM 2010»
15 years 4 months ago
Simple capacity-achieving ensembles of rateless erasure-correcting codes
—This paper is concerned with a simple binary erasure-recovery coding scheme that falls into the family of socalled semi-random low-density-parity-check (SR-LDPC) codes. Based on...
Xiaojun Yuan, Rong Sun, Li Ping
FOCS
2008
IEEE
16 years 1 days ago
On the Union of Cylinders in Three Dimensions
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
Esther Ezra
137
Voted
IEEESCC
2008
IEEE
16 years 9 hour ago
A Secure Information Flow Architecture for Web Services
Current web service platforms (WSPs) often perform all web services-related processing, including securitysensitive information handling, in the same protection domain. Consequent...
Lenin Singaravelu, Jinpeng Wei, Calton Pu
TOG
2008
102views more  TOG 2008»
15 years 5 months ago
A meshless hierarchical representation for light transport
We introduce a meshless hierarchical representation for solving light transport problems. Precomputed radiance transfer (PRT) and finite elements require a discrete representation...
Jaakko Lehtinen, Matthias Zwicker, Emmanuel Turqui...
180
Voted
TCSV
2008
139views more  TCSV 2008»
15 years 5 months ago
A Fast MB Mode Decision Algorithm for MPEG-2 to H.264 P-Frame Transcoding
Abstract--The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter-and intra-prediction modes at the expense of higher computat...
Gerardo Fernández-Escribano, Hari Kalva, Pe...