224 search results - page 42 / 45 » The Complexity of Finding Replicas Using Equality Tests |
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
78
Voted
CHI
2005
ACM
14 years 11 months ago
2005
ACM
HIPs, or Human Interactive Proofs, are challenges meant to be easily solved by humans, while remaining too hard to be economically solved by computers. HIPs are increasingly used ...
BMCBI
2010
14 years 9 months ago
2010
Background: Feature gene extraction is a fundamental issue in microarray-based biomarker discovery. It is normally treated as an optimization problem of finding the best predictiv...
BMCBI
2008
14 years 9 months ago
2008
Background: Protein-protein interaction networks are commonly sampled using yeast two hybrid approaches. However, whether topological information reaped from these experimentallym...
BMCBI
2008
14 years 9 months ago
2008
Background: Determining the function of uncharacterized proteins is a major challenge in the post-genomic era due to the problem's complexity and scale. Identifying a protein...