Sciweavers

969 search results - page 128 / 194
» Generalized matching from theory to application
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
EUROSYS
2007
ACM
15 years 10 months ago
Discrete control for safe execution of IT automation workflows
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...
Yin Wang, Terence Kelly, Stéphane Lafortune
ZUM
2000
Springer
15 years 9 months ago
Retrenchment, Refinement, and Simulation
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
Richard Banach, Michael Poppleton
ECIS
2003
15 years 7 months ago
The method evaluation model: a theoretical model for validating information systems design methods
Information Systems (IS) design research tends to emphasise the development of new methods (normative research), while addressing the evaluation of methods in only a limited fashi...
Daniel L. Moody
SIGMOD
2010
ACM
224views Database» more  SIGMOD 2010»
15 years 6 months ago
GDR: a system for guided data repair
Improving data quality is a time-consuming, labor-intensive and often domain specific operation. Existing data repair approaches are either fully automated or not efficient in int...
Mohamed Yakout, Ahmed K. Elmagarmid, Jennifer Nevi...