Sciweavers

76 search results - page 5 / 16
» Fast approximation of convex hull
Sort
View
COMPGEOM
1996
ACM
14 years 1 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
ICPR
2010
IEEE
14 years 2 months ago
Large Margin Classifier Based on Affine Hulls
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
Hakan Cevikalp, Hasan Serhan Yavuz
DAM
2007
84views more  DAM 2007»
13 years 9 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti

Publication
197views
12 years 5 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...
EOR
2002
87views more  EOR 2002»
13 years 9 months ago
On the finite convergence of successive SDP relaxation methods
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...
Masakazu Kojima, Levent Tunçel