Sciweavers

110 search results - page 13 / 22
» Minimal Partitions Of A Box Into Boxes
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
ICCV
2003
IEEE
14 years 9 months ago
Globally Convergent Autocalibration
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...
ICDM
2007
IEEE
176views Data Mining» more  ICDM 2007»
13 years 11 months ago
A Compact Representation of Spatio-Temporal Data
As technology advances we encounter more available data on moving objects, which can be mined to our benefit. In order to efficiently mine this large amount of data we propose an ...
Sigal Elnekave, Mark Last, Oded Maimon
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 5 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
DAC
2001
ACM
14 years 8 months ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics