Sciweavers

29 search results - page 2 / 6
» Recovering randomness from an asymptotic Hamming distance
Sort
View
TCS
2010
13 years 5 months ago
Cops and Robbers from a distance
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat
ICPR
2010
IEEE
13 years 5 months ago
3D Vertebral Body Segmentation Using Shape Based Graph Cuts
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we propose a novel 3D shape based met...
Melih S. Aslan, Asem M. Ali, Aly A. Farag, Ham M. ...
ICPR
2010
IEEE
13 years 6 months ago
Face Recognition At-A-Distance Using Texture, Dense and Sparse-Stereo Reconstruction
This paper introduces a framework for long-distance face recognition using dense and sparse stereo reconstruction, with texture of the facial region. Two methods to determine corr...
Ham Rara, Asem Ali, Shireen Elhabian, Aly A. Farag
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 7 months ago
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
Giacomo Como, Fabio Fagnani
ECCC
2011
204views ECommerce» more  ECCC 2011»
12 years 11 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman