2853 search results - page 91 / 571 » Finding related tables |
WWW
2008
ACM
14 years 11 months ago
2008
ACM
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
RECOMB
2001
Springer
14 years 10 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
BIBE
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper, we propose a system for finding partial positive and negative coregulated gene clusters in microarray data. Genes are clustered together if they show the same p...
GMP
2006
IEEE
14 years 4 months ago
2006
IEEE
For molding and casting processes, geometries that have undercut-free parting directions (UFPDs) are preferred for manufacturing. Identifying all UFPDs for arbitrary geometries at ...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...