Sciweavers

29 search results - page 2 / 6
» On Two-Intersection Sets with Respect to Hyperplanes in Proj...
Sort
View
BMVC
2010
13 years 3 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
CVIU
2006
168views more  CVIU 2006»
13 years 5 months ago
Fitting conics to paracatadioptric projections of lines
The paracatadioptric camera is one of the most popular panoramic systems currently available in the market. It provides a wide field of view by combining a parabolic shaped mirror...
João P. Barreto, Helder Araújo
SDM
2009
SIAM
152views Data Mining» more  SDM 2009»
14 years 2 months ago
Multiple Kernel Clustering.
Maximum margin clustering (MMC) has recently attracted considerable interests in both the data mining and machine learning communities. It first projects data samples to a kernel...
Bin Zhao, James T. Kwok, Changshui Zhang
DCC
2008
IEEE
13 years 5 months ago
A characterization of quadrics by intersection numbers
This work is inspired by a paper of Hertel and Pott on maximum non-linear functions [8]. Geometrically, these functions correspond with quasi-quadrics; objects introduced in [5]. ...
Jeroen Schillewaert
VLDB
1999
ACM
224views Database» more  VLDB 1999»
13 years 10 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim