1940 search results - page 209 / 388 » Optimizing search engines using clickthrough data |
143
click to vote
IPPS
2006
IEEE
16 years 15 days ago
2006
IEEE
Workflow enactment systems are becoming an effective solution to ease programming, deployment and execution of distributed applications in several domains such as telecommunicatio...
149
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
203
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
169
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
197
click to vote
FSTTCS
1998
Springer
15 years 10 months ago
1998
Springer
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...