Search

نمایش تعداد 1-10 از 10

New Families of Codebooks Achieving the Levenstein Bound

نوع: Journal Paper

نویسنده : Zhengchun Zhou; Cunsheng Ding; Nian Li

ناشر: IEEE

سال: 2014

Sequentially-Constructible Reversible Variable Length Codes

نوع: Journal Paper

نویسنده : Zahabi, Sayed Jalal; Aghajan, Adel; Khosravifard, Mohammadali

ناشر: IEEE

سال: 2014

On Extracting Common Random Bits From Correlated Sources on Large Alphabets

نوع: Journal Paper

نویسنده : Siu On Chan; Mossel, Elchanan; Neeman, Joe

ناشر: IEEE

سال: 2014

Detecting smart, self-propagating Internet worms

نوع: Conference Paper

نویسنده : Li, Jun; Stafford, Shad

ناشر: IEEE

سال: 2014

Cryogenic probing of mm-Wave MMIC LNAs for large focal-plane arrays in radio-astronomy

نوع: Conference Paper

نویسنده : Reeves, R.; Cleary, K.; Gawande, R.; Kooi, J.; Lamb, J.; Readhead, A.; Weinreb, S.; Gaier, T.; Kangaslahti, P.; Russell, D.; Samoska, L.; Varonen, M.; Lai, R.; Sarkozy, S.

ناشر: IEEE

سال: 2014

An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes

نوع: Journal Paper

نویسنده : Cullina, Daniel; Kiyavash, Negar

ناشر: IEEE

سال: 2014

Relationship classifier and stress analyzer in the mobile messaging application network through text mining

نوع: Conference Paper

نویسنده : Verma, A.; Gupta, A.; Kalra, P.

ناشر: IEEE

سال: 2014

Explicit Maximally Recoverable Codes With Locality

نوع: Journal Paper

نویسنده : Gopalan, Parikshit; Cheng Huang; Jenkins, Bob; Yekhanin, Sergey

ناشر: IEEE

سال: 2014

Comparative of heuristics on search of supervisors by approximated distinguishers

نوع: Conference Paper

نویسنده : Aguiar, Raquel S.S.; da Cunha, Antonio E.C.; Cury, Jose E.R.; de Queiroz, Max H.

ناشر: IEEE

سال: 2014

WiMAX network based E health service and telemedicine applications for rural and remote populations in India

نوع: Conference Paper

نویسنده : Chaudhari, Kalpana; Karule, P.T.

ناشر: IEEE

سال: 2014

Search

New Families of Codebooks Achieving the Levenstein Bound

Sequentially-Constructible Reversible Variable Length Codes

On Extracting Common Random Bits From Correlated Sources on Large Alphabets

Detecting smart, self-propagating Internet worms

Cryogenic probing of mm-Wave MMIC LNAs for large focal-plane arrays in radio-astronomy

An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes

Relationship classifier and stress analyzer in the mobile messaging application network through text mining

Explicit Maximally Recoverable Codes With Locality

Comparative of heuristics on search of supervisors by approximated distinguishers

WiMAX network based E health service and telemedicine applications for rural and remote populations in India

نویسنده

ناشر

سال

کلیدواژه

نوع

زبان

نوع محتوا

عنوان ناشر

Search

Filters

New Families of Codebooks Achieving the Levenstein Bound

Sequentially-Constructible Reversible Variable Length Codes

On Extracting Common Random Bits From Correlated Sources on Large Alphabets

Detecting smart, self-propagating Internet worms

Cryogenic probing of mm-Wave MMIC LNAs for large focal-plane arrays in radio-astronomy

An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes

Relationship classifier and stress analyzer in the mobile messaging application network through text mining

Explicit Maximally Recoverable Codes With Locality

Comparative of heuristics on search of supervisors by approximated distinguishers

WiMAX network based E health service and telemedicine applications for rural and remote populations in India