598 search results - page 31 / 120 » Stably compact spaces |
CPE
1998
Springer
13 years 11 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
CPM
1994
Springer
13 years 11 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
USS
2008
13 years 9 months ago
2008
We explore the problem of secret-key distribution in unidirectional channels, those in which a sender transmits information blindly to a receiver. We consider two approaches: (1) ...
FIMI
2004
13 years 8 months ago
2004
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compac...
ECBS
2007
IEEE
14 years 1 months ago
2007
IEEE
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...