Sciweavers

932 search results - page 132 / 187
» Uniform Random Number Generators
Sort
View
SEFM
2005
IEEE
15 years 3 months ago
Experimental Evaluation of FSM-Based Testing Methods
The development of test cases is an important issue for testing software, communication protocols and other reactive systems. A number of methods are known for the development of ...
Rita Dorofeeva, Nina Yevtushenko, Khaled El-Fakih,...
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
15 years 3 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant
ICCS
2005
Springer
15 years 3 months ago
Highly Scalable Algorithms for Robust String Barcoding
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoi...
ISMVL
2002
IEEE
120views Hardware» more  ISMVL 2002»
15 years 2 months ago
An Impact of Introducing Multi-Level Signals to a Bandpass Cascaded Delta-Sigma Modulator
An impact of introducing multi-level signals to a bandpass delta-sigma modulator (DSM), which is of particular interest for wireless communications applications, has been investig...
Takao Waho, Shin-ya Kobayashi, Koji Matsuura
COLT
1998
Springer
15 years 2 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann