4085 search results - page 509 / 817 » Benchmarking Data Mining Algorithms |
176
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
200
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Identifying candidate genes in genetic networks is important for understanding regulation and biological function. Large gene expression datasets contain relevant info...
166
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
202
click to vote
CGO
2011
IEEE
14 years 10 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
182
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseas...