Sciweavers

866 search results - page 21 / 174
» On Short Multiplications and Divisions
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
ICECCS
2002
IEEE
93views Hardware» more  ICECCS 2002»
15 years 2 months ago
Mnemosyne: Designing and Implementing Network Short-Term Memory
Network traffic logs play an important role in incident analysis. With the increasing throughput of network links, maintaining a complete log of all network activity has become a...
Giovanni Vigna, Andrew Mitchel
LREC
2010
195views Education» more  LREC 2010»
14 years 11 months ago
Adapting Chinese Word Segmentation for Machine Translation Based on Short Units
In Chinese texts, words composed of single or multiple characters are not separated by spaces, unlike most western languages. Therefore Chinese word segmentation is considered an ...
Yiou Wang, Kiyotaka Uchimoto, Jun'ichi Kazama, Can...
CHES
2010
Springer
183views Cryptology» more  CHES 2010»
14 years 10 months ago
Coordinate Blinding over Large Prime Fields
In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves. Specifically, this blinding method applies...
Michael Tunstall, Marc Joye
ICC
2007
IEEE
136views Communications» more  ICC 2007»
15 years 4 months ago
Sphere Decoder for a MIMO Multi-User MC-CDMA Uplink in Time-Varying Channels
— We focus on iterative detection for the uplink of a multi-carrier (MC) code division multiple access (CDMA) system based on orthogonal frequency division multiplexing (OFDM). T...
Charlotte Dumard, Thomas Zemen