1225 search results - page 177 / 245 » The Instance Complexity Conjecture |
ILP
2003
Springer
14 years 2 months ago
2003
Springer
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
DATE
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...
ICDM
2002
IEEE
14 years 2 months ago
2002
IEEE
Segmentation is a popular technique for discovering structure in time series data. We address the largely open problem of estimating the number of segments that can be reliably di...
SPAA
2010
ACM
14 years 2 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
GECCO
2010
Springer
14 years 2 months ago
2010
Springer
The increase in the complexity of modern software has led to the commensurate growth in the size and execution time of the test suites for these programs. In order to address this...