Sciweavers

583 search results - page 114 / 117
» Preferences in Answer Set Programming
Sort
View
BMCBI
2004
143views more  BMCBI 2004»
13 years 9 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh
CN
2002
77views more  CN 2002»
13 years 9 months ago
Architecture of a Web server accelerator
We describe the design, implementation and performance of a high-performance Web server accelerator which runs on an embedded operating system and improves Web server performance ...
Junehwa Song, Arun Iyengar, Eric Levy-Abegnoli, Da...
BMCBI
2011
13 years 4 months ago
SNPPicker: High quality tag SNP selection across multiple populations
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
Hugues Sicotte, David N. Rider, Gregory A. Poland,...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 10 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
SAT
2007
Springer
118views Hardware» more  SAT 2007»
14 years 3 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov