22 search results - page 3 / 5 » Optimizing Constraint-Based Mining by Automatically Relaxing... |
CP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
CVPR
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
KDD
2012
ACM
11 years 8 months ago
2012
ACM
Intelligence analysts grapple with many challenges, chief among them is the need for software support in storytelling, i.e., automatically ‘connecting the dots’ between dispar...
DATE
2010
IEEE
13 years 10 months ago
2010
IEEE
We present a Pareto efficient design method for multi-dimensional optimization of run-time reconfigurable streaming applications on CPU/FPGA platforms, which automatically allocate...