Sciweavers

454 search results - page 52 / 91
» Distance Education at a Glance
Sort
View
61
Voted
CORR
2010
Springer
72views Education» more  CORR 2010»
14 years 9 months ago
Rebuilding for Array Codes in Distributed Storage Systems
In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repa...
Zhiying Wang, Alexandros G. Dimakis, Jehoshua Bruc...
CORR
2008
Springer
130views Education» more  CORR 2008»
14 years 9 months ago
A Kernel Method for the Two-Sample Problem
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 9 months ago
Coding over an Erasure Channel with a Large Alphabet Size
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 9 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
76
Voted
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...