Sciweavers

1618 search results - page 140 / 324
» Testing random number generators
Sort
View
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
BMCBI
2004
114views more  BMCBI 2004»
13 years 10 months ago
Extending the mutual information measure to rank inferred literature relationships
Background: Within the peer-reviewed literature, associations between two things are not always recognized until commonalities between them become apparent. These commonalities ca...
Jonathan D. Wren
RCIS
2010
13 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
EUC
2007
Springer
14 years 4 months ago
A Key Distribution Scheme Preventing Collusion Attacks in Ubiquitous Heterogeneous Sensor Networks
Abstract. Random key pre-distribution schemes are vulnerable to collusion attacks. In this paper, we propose a new key management scheme for ubiquitous heterogeneous sensor network...
Firdous Kausar, Sajid Hussain, Jong Hyuk Park, Ash...
PDP
2007
IEEE
14 years 4 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller