243 search results - page 32 / 49 » Small Is Not Always Beautiful |
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
CVPR
2007
IEEE
13 years 8 months ago
2007
IEEE
Considerable research work has been done in the area of surveillance and biometrics, where the goals have always been high performance, robustness in security and cost optimizatio...
BMCBI
2006
13 years 8 months ago
2006
Background: A large number of genes usually show differential expressions in a microarray experiment with two types of tissues, and the p-values of a proper statistical test are o...
BMCBI
2004
13 years 7 months ago
2004
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...