725 search results - page 23 / 145 » A Generalization of Repetition Threshold |
JACM
1998
13 years 7 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
Electrothermal couplings between supply voltage, operating frequency, power dissipation and die temperature have been shown to significantly impact the energy-delay-product (EDP) ...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In a process of insect footprint recognition, footprint segments need to be extracted from scanned insect footprints in order to find out appropriate features for classi...
ESCIENCE
2006
IEEE
14 years 1 months ago
2006
IEEE
Several scientific projects use BOINC (Berkeley Open Infrastructure for Network Computing) to perform largescale simulations using volunteers’ computers (workers) across the Int...
ICAI
2003
13 years 9 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...