1361 search results - page 262 / 273 » Spaces of practice |
129
click to vote
CORR
2008
Springer
15 years 3 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...
124
click to vote
BMCBI
2006
15 years 3 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 ...
111
click to vote
CORR
2006
Springer
15 years 3 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...
135
click to vote
BMCBI
2007
15 years 3 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...
142
click to vote
CORR
2007
Springer
15 years 3 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...