14 search results - page 2 / 3 » Trichotomies for ideals of compact sets |
IDEAL
2007
Springer
14 years 3 days ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
TCC
2010
Springer
14 years 29 days ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
NC
2011
13 years 28 days ago
2011
Many different constructions of proofreading tile sets have been proposed in the literature to reduce the effect of deviations from ideal behaviour of the dynamics of the molecular...
PAKDD
2000
ACM
13 years 9 months ago
2000
ACM
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...