2434 search results - page 3 / 487 » Algorithmic Randomness of Closed Sets |
FIMI
2004
13 years 6 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
PAMI
2002
13 years 4 months ago
2002
AML
2006
13 years 5 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
DATE
2002
IEEE
13 years 10 months ago
2002
IEEE
Deterministic observation and random excitation of fault sites during the ATPG process dramatically reduces the overall defective part level. However, multiple observations of eac...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...