Sciweavers

4047 search results - page 328 / 810
» Algebraic Model Checking
Sort
View
ECCC
2007
88views more  ECCC 2007»
15 years 6 months ago
Combinatorial Construction of Locally Testable Codes
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
Or Meir
CORR
2004
Springer
99views Education» more  CORR 2004»
15 years 6 months ago
A class of one-dimensional MDS convolutional codes
A class of one-dimensional convolutional codes will be presented. They are all MDS codes, i. e., have the largest distance among all one-dimensional codes of the same length n and...
Heide Gluesing-Luerssen, Barbara Langfeld
ICDM
2005
IEEE
126views Data Mining» more  ICDM 2005»
16 years 10 days ago
Text Representation: From Vector to Tensor
In this paper, we propose a text representation model, Tensor Space Model (TSM), which models the text by multilinear algebraic high-order tensor instead of the traditional vector...
Ning Liu, Benyu Zhang, Jun Yan, Zheng Chen, Wenyin...
TACAS
2004
Springer
139views Algorithms» more  TACAS 2004»
16 years 2 days ago
Error Explanation with Distance Metrics
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...
Alex Groce
FM
2003
Springer
160views Formal Methods» more  FM 2003»
15 years 12 months ago
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
Fei Xie, James C. Browne, Robert P. Kurshan