Sciweavers

310 search results - page 56 / 62
» Communication Efficient Distributed Mining of Association Ru...
Sort
View
93
Voted
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 5 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
13 years 2 months ago
Transparent user models for personalization
Personalization is a ubiquitous phenomenon in our daily online experience. While such technology is critical for helping us combat the overload of information we face, in many cas...
Khalid El-Arini, Ulrich Paquet, Ralf Herbrich, Jur...
ACRI
2010
Springer
15 years 1 months ago
Network Decontamination with Temporal Immunity by Cellular Automata
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
Yassine Daadaa, Paola Flocchini, Nejib Zaguia
JNSM
2010
166views more  JNSM 2010»
14 years 7 months ago
High-Level Design Approach for the Specification of Cognitive Radio Equipments Management APIs
Cognitive Radio (CR) equipments are radio devices that support the smart facilities offered by future cognitive networks. Even if several categories of equipments exist (terminal,...
Christophe Moy
CCS
2010
ACM
15 years 12 days ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper