4934 search results - page 444 / 987 » complexity 2008 |
226
click to vote
SCN
2008
Springer
15 years 7 months ago
2008
Springer
We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to now,...
204
click to vote
TC
2008
15 years 7 months ago
2008
Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such schemes, low decoding ...
212
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
308
click to vote
MST
2010
15 years 6 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
223
click to vote
CAISE
2008
Springer
2008
Springer
How Much Language Is Enough? Theoretical and Practical Use of the Business Process Modeling Notation
15 years 9 months ago
The Business Process Modeling Notation (BPMN) is an increasingly important industry standard for the graphical representation of business processes. BPMN offers a wide range of mod...