Sciweavers

1169 search results - page 234 / 234
» Two Ways to Common Knowledge
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
12 years 8 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
IACR
2011
104views more  IACR 2011»
12 years 4 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
SPAA
2012
ACM
11 years 7 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
BMCBI
2010
240views more  BMCBI 2010»
13 years 5 months ago
TAM: A method for enrichment and depletion analysis of a microRNA category in a list of microRNAs
Background: MicroRNAs (miRNAs) are a class of important gene regulators. The number of identified miRNAs has been increasing dramatically in recent years. An emerging major challe...
Ming Lu, Bing Shi, Juan Wang, Qun Cao, Qinghua Cui