1361 search results - page 262 / 273 » Spaces of practice |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
BMCBI
2006
13 years 10 months ago
2006
Background: Ensemble attribute profile clustering is a novel, text-based strategy for analyzing a userdefined list of genes and/or proteins. The strategy exploits annotation data ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
BMCBI
2007
13 years 9 months ago
2007
nd: A key abstraction in representing proteomics knowledge is the notion of unique identifiers for individual entities (e.g. proteins) and the massive graph of relationships among...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...