Sciweavers

1132 search results - page 166 / 227
» Structural Average Case Complexity
Sort
View
BMCBI
2008
141views more  BMCBI 2008»
13 years 9 months ago
Ontology-guided data preparation for discovering genotype-phenotype relationships
Complexity of post-genomic data and multiplicity of mining strategies are two limits to Knowledge Discovery in Databases (KDD) in life sciences. Because they provide a semantic fr...
Adrien Coulet, Malika Smaïl-Tabbone, Pascale ...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
SIROCCO
2010
13 years 10 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
MM
2004
ACM
116views Multimedia» more  MM 2004»
14 years 2 months ago
A taxonomy for multimedia service composition
The realization of multimedia systems still heavily relies on building monolithic systems that need to be reengineered for every change in the application and little of which can ...
Klara Nahrstedt, Wolf-Tilo Balke