An efficient parallel and distributed algorithm for counting frequent sets (Contributo in atti di convegno)

Type
Label
  • An efficient parallel and distributed algorithm for counting frequent sets (Contributo in atti di convegno) (literal)
Anno
  • 2002-01-01T00:00:00+01:00 (literal)
Alternative label
  • Orlando S.; Palmerini P.; Perego R.; Silvestri F. (2002)
    An efficient parallel and distributed algorithm for counting frequent sets
    in High Performance Computing for Computational Science - VECPAR 2002, 5th International Conference
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Orlando S.; Palmerini P.; Perego R.; Silvestri F. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
  • High Performance Computing for Computational Science - VECPAR 2002, 5th International Conference, Porto, Portugal, June 26-28, 2002, Selected Papers and Invited Talks. (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • VECPAR'2002 - 5th International Meeting on High Performance Computing for Computational Science (Porto, Portugal, July 2002). Proceedings, pp. 415-428. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • CNR, Univ. di Venezia (literal)
Titolo
  • An efficient parallel and distributed algorithm for counting frequent sets (literal)
Prodotto di
Autore CNR

Incoming links:


Autore CNR di
Prodotto
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
data.CNR.it