Sciweavers

7758 search results - page 63 / 1552
» On the Number of Distributive Lattices
Sort
View
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 8 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
WSC
2008
13 years 11 months ago
A plug-in-based architecture for random number generation in simulation systems
Simulations often depend heavily on random numbers, yet the impact of random number generators is recognized seldom. The generation of random numbers for simulations is not trivia...
Roland Ewald, Johannes Rossel, Jan Himmelspach, Ad...
MOC
2002
90views more  MOC 2002»
13 years 8 months ago
Explicit bounds and heuristics on class numbers in hyperelliptic function fields
Abstract. In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function fiel...
Andreas Stein, Edlyn Teske
IJCCBS
2010
146views more  IJCCBS 2010»
13 years 7 months ago
A meta-level true random number generator
: True random number generators (TRNGs) are extensively used in cryptography, simulations and statistics. In this work, we introduce, extend and analyse the concept of the randomis...
Bernhard Fechner, Andre Osterloh
ICDM
2006
IEEE
184views Data Mining» more  ICDM 2006»
14 years 2 months ago
MARGIN: Maximal Frequent Subgraph Mining
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
Lini T. Thomas, Satyanarayana R. Valluri, Kamalaka...