Sciweavers

28 search results - page 2 / 6
» Compact linearization for binary quadratic problems
Sort
View
IJCNN
2006
IEEE
14 years 9 days ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
CVPR
2010
IEEE
13 years 8 months ago
Co-clustering of Image Segments Using Convex Optimization Applied to EM Neuronal Reconstruction
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...
Shiv Vitaladevuni, Ronen Basri
ANOR
2011
117views more  ANOR 2011»
12 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
13 years 11 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran
ACSC
2007
IEEE
14 years 19 days ago
Compact Layout of Layered Trees
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...
Kim Marriott, Peter Sbarski