16404 search results - page 562 / 3281 » A set coverage problem |
181
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
202
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
230
click to vote
PAMI
2008
15 years 6 months ago
2008
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
146
click to vote
CPM
2004
Springer
16 years 11 days ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
199
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...