Sciweavers

Share
ORL
2011
9 years 1 months ago
Random half-integral polytopes
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive pr...
Gábor Braun, Sebastian Pokutta
CORR
2011
Springer
157views Education» more  CORR 2011»
9 years 2 months ago
Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
Esther Ezra, Wolfgang Mulzer
IOR
2011
133views more  IOR 2011»
9 years 5 months ago
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
Binyuan Chen, Simge Küçükyavuz, S...
DCG
2011
9 years 5 months ago
More Colourful Simplices
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
Antoine Deza, Tamon Stephen, Feng Xie
ACMSE
2010
ACM
9 years 5 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
ISW
2010
Springer
9 years 8 months ago
Cryptanalysis of the Convex Hull Click Human Identification Protocol
Recently a convex hull based human identification protocol was proposed by Sobrado and Birget, whose steps can be performed by humans without additional aid. The main part of the p...
Hassan Jameel Asghar, Shujun Li, Josef Pieprzyk, H...
COLT
2010
Springer
9 years 8 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...
SIAMDM
2010
130views more  SIAMDM 2010»
9 years 9 months ago
On the Hull Number of Triangle-Free Graphs
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
Mitre Costa Dourado, Fábio Protti, Dieter R...
MP
2010
128views more  MP 2010»
9 years 9 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
SIAMJO
2000
113views more  SIAMJO 2000»
9 years 10 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel
books