Sciweavers

Share
21 search results - page 1 / 5
» Determining the Convex Hull in Large Multidimensional Databa...
Sort
View
DAWAK
2001
Springer
11 years 9 months ago
Determining the Convex Hull in Large Multidimensional Databases
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
Christian Böhm, Hans-Peter Kriegel
ISBI
2004
IEEE
12 years 6 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov
ICPR
2010
IEEE
11 years 9 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

Publication
197views
10 years 1 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...
SIGMOD
1999
ACM
110views Database» more  SIGMOD 1999»
11 years 9 months ago
Multi-dimensional Selectivity Estimation Using Compressed Histogram Information
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
Ju-Hong Lee, Deok-Hwan Kim, Chin-Wan Chung
books