738 search results - page 57 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
102
click to vote
KDD
2006
ACM
15 years 10 months ago
2006
ACM
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
ISCI
2006
14 years 9 months ago
2006
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....
VIP
2003
14 years 11 months ago
2003
Using different algorithms to segment different images is a quite straightforward strategy for automated image segmentation. But the difficulty of the optimal algorithm selection ...
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...