777 search results - page 127 / 156 » A fast algorithm for the computation of an upper bound on th... |
IWSEC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
SEMWEB
2010
Springer
13 years 6 months ago
2010
Springer
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
CONSTRAINTS
2011
13 years 3 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
AUSDM
2007
Springer
14 years 2 months ago
2007
Springer
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
MOC
2011
12 years 11 months ago
2011
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...