Sciweavers

285 search results - page 2 / 57
» Steaming on Convex Hulls
Sort
View
ORL
2011
12 years 10 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

Publication
197views
12 years 3 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
JCO
2008
153views more  JCO 2008»
13 years 7 months ago
A quadratic lower bound for colourful simplicial depth
We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.
Tamon Stephen, Hugh Thomas
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
13 years 11 months ago
Using convex hulls to represent classifier conditions
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
Pier Luca Lanzi, Stewart W. Wilson
IWCIA
2004
Springer
14 years 22 days ago
Convex Hulls in a 3-Dimensional Space
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm stract polyhedron being described by a new ...
Vladimir Kovalevsky, Henrik Schulz