Sciweavers

285 search results - page 17 / 57
» Steaming on Convex Hulls
Sort
View
PODS
2003
ACM
116views Database» more  PODS 2003»
15 years 9 months ago
On nearest neighbor indexing of nonlinear trajectories
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
Charu C. Aggarwal, Dakshi Agrawal
112
Voted
IOR
2011
133views more  IOR 2011»
14 years 4 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...
MP
2010
100views more  MP 2010»
14 years 7 months ago
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming...
Mohit Tawarmalani, Jean-Philippe P. Richard, Kwang...
SIAMJO
2000
113views more  SIAMJO 2000»
14 years 9 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
COLT
2010
Springer
14 years 7 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...