9842 search results - page 1318 / 1969 » The Complexity of the Matching-Cut Problem |
177
click to vote
CORR
2006
Springer
15 years 7 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...
207
click to vote
DATAMINE
2006
15 years 7 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
225
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
175
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Accurate selection of splice sites during the splicing of precursors to messenger RNA requires both relatively well-characterized signals at the splice sites and auxil...
219
click to vote
CGF
2007
15 years 7 months ago
2007
The automatic selection of good viewing parameters is a very complex problem. In most cases, the notion of good strongly depends on the concrete application. Moreover, when an int...