Sciweavers

55 search results - page 10 / 11
» Bounds on pseudoexhaustive test lengths
Sort
View
IVC
2007
102views more  IVC 2007»
13 years 7 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
LICS
2010
IEEE
13 years 5 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
RECOMB
2008
Springer
14 years 7 months ago
Sorting Cancer Karyotypes by Elementary Operations
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
Michal Ozery-Flato, Ron Shamir
FMICS
2006
Springer
13 years 11 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
LREC
2008
136views Education» more  LREC 2008»
13 years 8 months ago
Design and Recording of Czech Audio-Visual Database with Impaired Conditions for Continuous Speech Recognition
In this paper we discuss the design, acquisition and preprocessing of a Czech audio-visual speech corpus. The corpus is intended for training and testing of existing audio-visual ...
Jana Trojanová, Marek Hrúz, Pavel Ca...