Sciweavers

500 search results - page 95 / 100
» codes 1998
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 4 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
ECCC
1998
118views more  ECCC 1998»
14 years 9 months ago
Chinese Remaindering with Errors
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
Oded Goldreich, Dana Ron, Madhu Sudan
ANSOFT
1998
140views more  ANSOFT 1998»
14 years 9 months ago
FORM: A Feature-Oriented Reuse Method with Domain-Specific Reference Architectures
Systematic discovery and exploitation of commonality across related software systems is a fundamental technical requirement for achieving successful software reuse. By examining a...
Kyo Chul Kang, Sajoong Kim, Jaejoon Lee, Kijoo Kim...
CVPR
1998
IEEE
15 years 11 months ago
Subtly Different Facial Expression Recognition and Expression Intensity Estimation
We have developed a computer vision system, including both facial feature extraction and recognition, that automatically discriminates among subtly different facial expressions. E...
James Jenn-Jier Lien, Takeo Kanade, Jeffrey F. Coh...
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
15 years 10 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans