8294 search results - page 247 / 1659 » Presenting Data from Experiments in Algorithmics |
207
click to vote
JCB
2002
15 years 6 months ago
2002
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
175
click to vote
VLDB
1999
ACM
15 years 10 months ago
1999
ACM
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
182
click to vote
ICARIS
2003
Springer
15 years 11 months ago
2003
Springer
Supermarkets lose millions of pounds every year through lost trading and stock wastage caused by the failure of refrigerated cabinets. Therefore, a huge commercial market exists fo...
191
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
170
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
We focus on clustering gene expression temporal profiles, and propose a novel, simple algorithm that is powerful enough to find an efficient distribution of genes over clusters. We...