Sciweavers

2177 search results - page 301 / 436
» Relative Margin Machines
Sort
View
COMPSYSTECH
2007
14 years 2 months ago
A refinement model with information granulation focused on difficult to distinguish cases
: The paper proposes a different approach to data modeling. Analogous to the rejection method, where the misclassifications are removed and manually evaluated, we focus here on dif...
Plamena Andreeva, Plamen Andreev, Maya Dimitrova, ...
RTA
2010
Springer
14 years 2 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
ASWEC
2004
IEEE
14 years 1 months ago
A Process Framework for Characterising Security Properties of Component-Based Software Systems
This paper presents a security characterisation process framework for software components and their compositions in order to address the issue of trust in component based software...
Khaled M. Khan, Jun Han
BPM
2006
Springer
153views Business» more  BPM 2006»
14 years 1 months ago
Decision Mining in ProM
Process-aware Information Systems typically log events (e.g., in transaction logs or audit trails) related to the actual business process executions. Proper analysis of these execu...
Anne Rozinat, Wil M. P. van der Aalst
CCS
2006
ACM
14 years 1 months ago
Cryptanalysis of the "Grain" family of stream ciphers
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
Alexander Maximov